Discrete mathematics
P Grossman
6 points * 3 hours of lectures and 1 hour of tutorials per week * First semester * Caulfield * Prohibitions: MAT1130, MAT1131
Algorithms, base conversions, computer arithmetic, propositional and predicate logic, Boolean algebra, logic gate circuits, recursion, induction, sets, relations, functions, combinatorics, graph theory, trees. Applications to computing.
Assessment
Test (1 hour): 20% * Assignment: 15% * Examinations (3 hours): 65%
Prescribed texts
Grossman P A Discrete mathematics for computing Macmillan, 1994
Recommended texts
Munro J E Discrete mathematics for computing Nelson, 1992
Ross K A and Wright C R B Discrete mathematics 3rd edn, Prentice-Hall, 1992