Graphs, logic and numbers
Coordinator: Dr Rod Worley
6 points * Three 1-hour lectures per week and 1 hour of tutorial work * First/Second semester - Clayton * First semester - Caulfield * Prerequisites: At levels 3 and 4, VCE Mathematical Methods * Prohibitions: CSC1090, MAT1470, MAT1830, GAS1614
Objectives On the completion of this subject students will understand what a proof is; be able to construct proofs using modus ponens, contradiction and mathematical induction; be able to represent information using numbers, relations, functions and graphs.
Synopsis Topics fundamental to mathematics and computing, including elementary number theory, sets, relations and functions; methods of logic and proof, especially proof by induction; recurrence relations and difference equations; trees and other graphs.
Assessment Examinations (2 hours): 85% * Practicals and/or assignments: 15%
Recommended texts
Grossman P A Discrete mathematics for computing Macmillan, 1995
Munro, J E M Discrete mathematics for computing Nelson, 1993
| Published by Monash University, Clayton, Victoria
3168 Copyright © Monash University 1996 - All Rights Reserved - Caution Authorised by the Academic Registrar December 1996 |