This module is designed to introduce students to language and methods of the area of Discrete Mathematics.
The focus of the module is on basic mathematical concepts in discrete maths and on applications of discrete mathematics in algorithms and data structures. One of the aims will be to show students how discrete mathematics can be used in modem computer science (with the focus on algorithmic applications).
This is an indicative module outline only to give an indication of the sort of topics that may be covered. Actual sessions held may differ.
BigOh notation and its use in the analysis of algorithms.
Basic concepts from graph theory; such as trees, matchings, euler tours, colorings and cuts.
Applications of discrete probability; such as probabilistic method, random walks and entropy.
By the end of the module, students should be able to:
To be finalised.
Basic knowledge of graph theory and its applications in algorithms
Basic knowledge of discrete probability and its applications in algorithms
Understanding and using asymptotic notations in design and analysis of algorithms
Communication  Reading and writing mathematical proofs
Critical thinking  problem solving
Type  Required 

Lectures  30 sessions of 1 hour (30%) 
Seminars  9 sessions of 1 hour (9%) 
Private study  31 hours (31%) 
Assessment  30 hours (30%) 
Total  100 hours 
Revision of lectures
Going through the problems solved during seminar sessions
Solving past exam papers
No further costs have been identified for this module.
You do not need to pass all assessment components to pass the module.
Students can register for this module without taking any assessment.
Weighting  Study time  

Coursework  20%  10 hours 
Homework exercise consisting of several problems. 

Inperson Examination  80%  20 hours 
CS137 final exam (Summer)

Weighting  Study time  

Inperson Examination  Resit  100%  
CS137 resit exam (September)

Marked scripts available on students' request
This module is Core for:
This module is Option list B for: