Module 21254 (2012)
Syllabus page 2012/2013
06-21254
Mathematical Techniques for Computer Science
Level 2/I
Links | Outline | Aims | Outcomes | Prerequisites | Teaching | Assessment | Books | Detailed Syllabus
The Module Description is a strict subset of this Syllabus Page. (The University module description has not yet been checked against the School's.)
Relevant Links
Outline
Computer Science makes use of a variety of mathematical techniques to describe and solve computational problems. Often, these techniques are quite deep and outside the scope of standard mathematical syllabuses, for example, the use of structural recursion in the analysis of data structures and programming languages. The module aims to present a core of mathematical techniques in a sample computational context, and tries to strike a balance between systematic introduction and an application-orientated "maths-by-need" approach.
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: | Assessed by: | |
| 1 | solve simple mathematical problems in the areas covered by the module | Examination, Continuous assessment |
| 2 | apply a given mathematical technique to solve a problem within a computer science setting | Examination, Continuous assessment |
Restrictions, Prerequisites and Corequisites
Restrictions:
None
Prerequisites:
06-20415 (Introduction to Mathematics for Computer Science) or A-level Mathematics at grade C or above (or equivalent)
Co-requisites:
None
Teaching
Teaching Methods:
2 hrs/week of lectures plus 1 hr/week exercise classes.
Contact Hours:
Assessment
- Sessional: 1.5 hr examination (80%), continuous assessment (20%).
- Supplementary (where allowed): By examination only.
- The continuous assessment consists of two class tests (10%) plus weekly homework (10%).
Recommended Books
| Title | Author(s) | Publisher, Date |
| Lecture Notes | Achim Jung |
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
Last updated: 31 July 2009
Source file: /internal/modules/COMSCI/2012/xml/21254.xml
Links | Outline | Aims | Outcomes | Prerequisites | Teaching | Assessment | Books | Detailed Syllabus