# Module 06-21254 (2012)

## Mathematical Techniques for Computer Science

## Level 2/I

Steven Vickers | Semester 1 | 10 credits |

Co-ordinator: Steven Vickers

Reviewer: Hamid Dehghani

The Module Description is a strict subset of this Syllabus Page.

### Aims

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

### Learning Outcomes

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

### Teaching methods

2 hrs/week of lectures plus 1 hr/week exercise classes.

### Assessment

- Sessional: 1.5 hr examination (80%), continuous assessment (20%).
- Supplementary: By examination only.

### Detailed Syllabus

- Linear Algebra
- solving systems of linear equations
- describing geometric objects in the plane and in space
- matrices

- The language of sets
- sets
- functions
- relations

- Induction
- inductive definitions
- recursive functions
- proof by structural induction

- Probability
- finite probabilities
- distributions

### Programmes containing this module

- BEng Computer Science/Software Engineering [4753]
- BEng Computer Science/Software Engineering with an Industrial Year [9500]
- BSc Computer Science [4436]
- BSc Computer Science with an Industrial Year [9499]
- BSc Computer Science with Study Abroad [5571]
- MEng Computer Science/Software Engineering [4754]
- MEng Computer Science/Software Engineering with an Industrial Year [9501]