Authorised by Academic Registrar, April 1996
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%