Discrete mathematics II
4 points * Second semester * Clayton * Prerequisites: MAT1130 or MAT1470 or a 12-point sequence in first-year mathematics including MAT1010 or MAT1020 (a credit grade or higher in MAT1050 is an acceptable alternative to a pass in MAT1010) * Prohibitions: GAS3614
Objectives On the completion of this subject students will understand counting techniques for combinatorial problems; develop skills for calculating using recurrence relations; develop flow networks and achieve an understanding of the max flow/min cut theorem; understand the concepts of binary codes, in particular linear codes.
Synopsis 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
| Published by Monash University, Clayton, Victoria
3168 Copyright © Monash University 1996 - All Rights Reserved - Caution Authorised by the Academic Registrar December 1996 |