Second Year Discrete Mathematics MEng 2019/20
The objective of the second year course for Discrete Mathematics is to integrate the mathematical and computational perspectives that underpin Discrete Mathematics. The modules provide a broader theoretical base for Discrete Mathematics students, and help to equip them for different kinds of specialisation in the advanced study of discrete structures and algorithms. The core modules cover the areas of combinatorics, graph theory, and the design of algorithm and data structures, as taught jointly in Mathematics and Computer Science.
The normal load is 120 CATS credits. Students are required to take six core modules totalling 81 CATS and further modules selected from the list of optional modules below, including at least 12 CATS credits from List A. List B contains level 2 modules delivered by Computer Science, Mathematics and Statistics.
Core Modules 
Term

CATS

Examined/

MA241 Combinatorics  1  12  E(90) A(10) 
MA258 Mathematical Analysis III  1  12  E(85) A(15) 
MA260 Norms, Metrics & Topologies  2  12  E(85) A(15) 
CS254 Algorithmic Graph Theory  2  15  E(80) A(20) 
CS259 Formal Languages  2  15  E(70) A(30) 
CS260 Algorithms *  1  15  E(70) A(30) 
Optional Modules  List A 

CS262 Logic and Verification  2  15  E(75) A(25) 
ST202 Stochastic Processes  2  12  E(95) A(5) 
MA252 Combinatorial optimisation  2  12  E(100) 
MA257 Introduction to Number Theory  2  12  E(85) A(15) 
Optional Modules  List B


Level 2 modules delivered by Computer Science, Mathematics and Statistics. 
* This module will be examined normally in the first week of Term 3.
Modules from other Departments
More information on modules taught by other departments can be found at the following sites: