This unit introduces students to several related areas of discrete mathematics, which serve their interests for further study in pure and applied mathematics, computer science and engineering. Topics to be covered in the first part of the unit include recursion and induction, generating functions and recurrences, combinatorics. Topics covered in the second part of the unit include Eulerian and Hamiltonian graphs, the theory of trees (used in the study of data structures), planar graphs, the study of chromatic polynomials (important in scheduling problems).
Three 1 hour lectures, one 1 hour tutorial and one 1 hour practice class per week.
One 2 hour exam, assignments, quizzes (100%)
6 credit points of Junior Mathematics unitsProhibitions
MATH2011 or MATH2009 or MATH2969