Authorised by Academic Registrar, April 1996
Objectives At the completion of this subject students should know and understand the basic concepts and techniques in a number of topics in discrete mathematics; be able to apply these techniques to problems in computing; and be able to recognise situations in computing where a mathematical approach is useful and formulate such situations in terms of the mathematical concepts studied in this subject.
Synopsis Algorithms, base conversions, computer representation of numbers, computer arithmetic, propositional and predicate logic, Boolean algebra, logic gate circuits, recursion, induction, sets, relations, functions, combinatorics, graph theory, Eulerian and Hamiltonian circuits, trees, minimal spanning trees, expression trees. Applications to computing.
Assessment Examination (3 hours): 70% + Test (1 hour): 10% + Assignments (2): 20%