Module 21254 (2012)

Module Description - Mathematical Techniques for Computer Science

The Module Description is a strict subset of the Syllabus Page, which gives more information

Module TitleMathematical Techniques for Computer Science
SchoolComputer Science
Module Code06-21254
DescriptorCOMP/06-21254/LI
Member of StaffSteven Vickers
LevelI
Credits10
Semester1
Pre-requisites06-20415 (Introduction to Mathematics for Computer Science) or A-level Mathematics at grade C or above (or equivalent)
Co-requisitesNone
RestrictionsNone
Contact hours35
Delivery2 hrs/week of lectures plus 1 hr/week exercise classes.
Description 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.
Outcomes
On successful completion of this module, the student should be able to:Assessed by:
solve simple mathematical problems in the areas covered by the module Examination, Continuous assessment
apply a given mathematical technique to solve a problem within a computer science setting Examination, Continuous assessment
AssessmentSessional: 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%).
TextsAchim Jung, Lecture Notes,