MAT1077

Discrete mathematics

Dr David Wilson

6 points - Second semester - 3 hours of lectures and one 1-hour tutorial per week - Gippsland and distance - Prerequisites: GCO1815 or Year 12 Mathematics - Prohibitions: GAS1614, MAT1130

Objectives On 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 databases; to demonstrate an understanding of graphs, directed graphs, trees and tree traversal.

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 the 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 specifications; Boolean algebra and applications to the design of simple logic circuits; graphs and graph theoretic algorithms; computability, finite state machines, regular grammars and their applications. For distance students, four three-hour expository and discussion classes are available over the semester, to supplement full notes and the textbook.

Assessment Class tests and assignments: 30% - Examination: 70%

Prescribed texts

Epp S Discrete mathematics with applications 2nd edn, Brooks-Cole, 1995

Back to the 1999 Science Handbook