Course Details in

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
Pre-requisites
Co-requisites
Restrictions	As given in the programme specifications for School of Computer Science programmes.
Contact Hours	Lecture-23 hours Seminar-0 hours Tutorial-0 hours Project supervision-0 hours Demonstration-0 hours Practical Classes and workshops-11 hours Supervised time in studio/workshop-0 hours Fieldwork-0 hours External Visits-0 hours Work based learning-0 hours Guided independent study-0 hours Placement-0 hours Year Abroad-0 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 application-orientated ¿maths-by-need¿ 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	21254-01 : Examination : Exam (Centrally Timetabled) - Written Unseen (80%) 21254-02 : 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