MA210 Half Unit
Discrete Mathematics
This information is for the 2011/12 session.
Teacher responsible
Dr Jozef Skokan, COL 3.04
Availability
BSc Mathematics and Economics and BSc Mathematics with Economics. Also available as an outside option. Available to General Course students with permission.
Pre-requisites
MA103 Introduction to Abstract Mathematics, or an equivalent course giving a background in rigorous mathematics.
Course content
A second-level course covering some of the main concepts and techniques of discrete mathematics together with its applications. Topics covered: Counting: selections, inclusion-exclusion, partitions and permutations, generating functions, recurrence relations. Graph Theory: basic concepts (graph, adjacency matrix, etc), walks and cycles, trees and forests, colourings. Optional topics include coding theory, designs, and algorithms and their efficiency.
Teaching
20 hours of lectures and 10 hours of classes in the Lent Term.
Formative coursework
Weekly exercises are set and marked.
Indicative reading
PJ Cameron, Combinatorics (CUP 1994); NL Biggs, Discrete Mathematics (OUP 2004)
Assessment
A two-hour examination in the ST (100%). ^
| 
