Graphs, logic and numbers
R Worley
6 points
* Three 1-hour lectures per week and one 1-hour tutorial
*
First, second semester
* Clayton
* First semester
* Caulfield
*
Prerequisites: At levels 3 and 4, VCE Mathematical Methods
* Prohibitions:
GAS1614, MAT1470, MAT1830
Objectives On the completion of this subject students should understand what a proof is; be able to construct proofs using modus ponens, contradiction and mathematical induction; and 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
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 |