Discrete mathematics II
4 points * Second semester * Clayton * Prerequisites: MAT1130 or a 12-point sequence in first-year mathematics including MAT1011 or MAT1022 (a credit grade or higher in MAT1051 is an acceptable alternative to a pass in MAT1011)
Permutations and combinations. Recurrence relations. Graphs: Menger's theorem and the max flow/min cut theorem, with applications to optimisation in flow situations, for example traffic and distribution networks. Coding theory: finite fields.
Assessment
Examinations (1.5 hours): 80% * Tests: 20%
Prescribed texts
Dossey J A and others Discrete mathematics Harper Collins, 1993
Recommended texts
Roberts F S Applied combinatorics Prentice-Hall, 1984