Module 06-21254 (2012)
Mathematical Techniques for Computer Science
|Steven Vickers||Semester 1||10 credits|
Co-ordinator: Steven Vickers
Reviewer: Hamid Dehghani
The Module Description is a strict subset of this Syllabus Page.
The aims of this module are to:
- present mathematical techniques that underly Computer Science
- present these techniques in a sample Computer Science context
- illustrate the power of mathematics in solving problems in Computer Science
- provide an introduction to Linear Algebra, Set Theory, Structural Induction, and Probability
On successful completion of this module, the student should be able to:
- solve simple mathematical problems in the areas covered by the module
- apply a given mathematical technique to solve a problem within a computer science setting
2 hrs/week of lectures plus 1 hr/week exercise classes.
- Sessional: 1.5 hr examination (80%), continuous assessment (20%).
- Supplementary: By examination only.
- Linear Algebra
- solving systems of linear equations
- describing geometric objects in the plane and in space
- The language of sets
- inductive definitions
- recursive functions
- proof by structural induction
- finite probabilities
Programmes containing this module
- BEng Computer Science/Software Engineering 
- BEng Computer Science/Software Engineering with an Industrial Year 
- BSc Computer Science 
- BSc Computer Science with an Industrial Year 
- BSc Computer Science with Study Abroad 
- MEng Computer Science/Software Engineering 
- MEng Computer Science/Software Engineering with an Industrial Year