Discrete mathematics
Dr David Wilson and Dr Richard Farmer
6 points * Second semester * 3 hours lectures and one 1-hour tutorial per week * Gippsland/Distance/Peninsula * Prerequisite: GCO1815 or Year 12 Mathematics * Prohibitions: MAT1130
Objectives On the completion of this subject, students should be able to understand the basic principles of logic, methods of mathematical proof, and the use of predicate calculus to prove that a computer program meets its specifications; to express quantitative and logical relationships between variables and statements in programming languages; to appreciate the limitations of the computer as a calculating machine; to display an understanding of finite state machines, regular grammars, and their applications; to perform operations with relations and functions, and understand their applications to the study of relational data bases; to demonstrate an understanding of graphs, directed graphs and trees, tree traversal, and binary trees.
Synopsis This subject aims to provide students with a basic understanding of logic, and the ability to use techniques in finite and discrete mathematics; in particular mathematics relevant to the design and development of good computer software. Topics covered include the techniques of propositional calculus and applications to the design of computer programs; techniques for constructing standard mathematical proofs; predicate calculus and how it may be used in proving that a computer program meets its specification; Boolean algebra and applications to the design of simple combinatorial switching circuits; graphs and graph theoretic algorithms; computability finite state machines, regular grammars, and their applications.
Assessment Continuous assessment: 40% * Examination (3 hours): 60%
Prescribed texts
To be advised on enrolment
| Published by Monash University, Clayton, Victoria
3168 Copyright © Monash University 1996 - All Rights Reserved - Caution Authorised by the Academic Registrar December 1996 |