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

Code	Name	Term	CATS Credits
MA222	Metric Spaces	2	12
MA241	Combinatorics	1	12
MA258	Mathematical Analysis III	1	12
CS254	Algorithmic Graph Theory	2	15
CS259	Formal Languages	2	15
CS260	Algorithms *	1	15

Optional Modules - List A

Code	Name	Term	CATS Credits
CS262	Logic and Verification	2	15
ST202	Stochastic Processes	2	12
MA252	Combinatorial Optimisation	2	12
MA257	Introduction to Number Theory	2	12

Optional Modules - List B

Code	Name	Term	CATS Credits
Modules selected from level 2 modules delivered by Computer Science, Mathematics and Statistics.

Modules from Other Departments

More information on modules taught by other departments can be found in the Module Catalogue: https://courses.warwick.ac.uk.

* This module will be examined normally in the first week of Term 3.