Module Title  Mathematical Techniques for Computer Science 
School  Computer Science 
Department  Computer Science 
Module Code  06 21254 
Module Lead  Dr S J Vickers 
Level  Intermediate Level 
Credits  10 
Semester  Semester 1 
Prerequisites 

Corequisites 

Restrictions  As given in the programme specifications for School of Computer Science
programmes. 
Contact Hours 
Lecture23 hours
Seminar0 hours
Tutorial0 hours
Project supervision0 hours
Demonstration0 hours
Practical Classes and workshops11 hours
Supervised time in studio/workshop0 hours
Fieldwork0 hours
External Visits0 hours
Work based learning0 hours
Guided independent study0 hours
Placement0 hours
Year Abroad0 hours

Exclusions  
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
applicationorientated ¿mathsbyneed¿ approach. 
Learning Outcomes  By the end of the module the student is expected to be able to:
solve simple mathematical problems in the areas covered by the module;

apply a given mathematical technique to solve a computational problem;

select a suitable mathematical language to express a given computational problem.

Assessment 
2125401 : Examination : Exam (Centrally Timetabled)  Written Unseen (80%)
2125402 : Continuous Assessment : Coursework (20%)

Assessment Methods & Exceptions  Sessional) 1.5 hr examination (80%), continuous assessment (20%).
Supplementary assessment (where allowed): By examination only. 
Other  
Reading List 
