The purpose of this unit is to give a grounding in discrete mathematics. It is important preparation for both theoretical computing and abstract algebra. In particular, the unit: explores the concept of computability, and the measures of computational complexity and finite state machines; studies recurrence relations and generating functions; provides an introduction to discrete probability; applies graph theory to a range of problems; and examines a variety of error correcting and public key cryptography codes. -- Course Website
Instructor: Mathematics staff
Prerequisites: DMTH137 or MATH133 or MATH136
