MAT1077 - Discrete mathematics

Leader: Dr John Arkinstall

Offered

Gippsland Second semester 2007 (Day)
Gippsland Second semester 2007 (Off-campus)
Hong Kong Second semester 2007 (Off-campus)
Singapore Second semester 2007 (Off-campus)

Synopsis

This unit 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 propositional calculus and application to the design of computer programs; techniques for constructing standard mathematical proofs; predicate calculus and its use 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.

Objectives

On completion of this unit, 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.

Assessment

Class tests and assignments: 30%
Examination: 70%

Contact hours

3 hours of lectures and one 1-hour tutorials per week

Prerequisites

GCO1815 or Year 12 Mathematics

Prohibitions

MTH1112