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.
Introduction to combinatorics: counting techniques, pigeonhole principle, inclusionexclusion.
Recurrence relations, solving recurrences using generating functions.
Master Theorem for solving recurrences.
Graphs. Basic graph algorithms. Trees. Applications of graphs.
Applications of linear algebra and matrix algebra in algorithms (e.g., in web searching).
Algorithmic applications of random processes and Markov chains, for example, cover time in graphs and card shuffling.
Partitions, enumerations with symmetries.
By the end of the module, students should be able to:
Please see Talis Aspire link for most up to date list.
View reading list on Talis Aspire
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
Technical  Technological competence and staying current with knowledge
Type  Required 

Lectures  30 sessions of 1 hour (21%) 
Seminars  9 sessions of 1 hour (6%) 
Private study  81 hours (58%) 
Assessment  20 hours (14%) 
Total  140 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  

CS137 Coursework  10%  
CS137 Coursework  10%  10 hours 
Oncampus Examination  80%  10 hours 
CS137 exam ~Platforms  AEP

Weighting  Study time  

Online Examination  100%  
CS137 resit exam ~Platforms  AEP

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