Search | Previous : 433-254 | Next : 433-256
Handbook 1997 : Faculty of Engineering : School of Electrical Engineering and Computer Science

433-255 Models of Computation

Note:

Credit may not be granted for both 433-255 Models of Computation and 618-131 Discrete Mathematics (Advanced) or 433-245 Programming Language Principles B.

Credit Points:

When taken from School of Electrical Engineering and Computer Science, Faculty of Engineering:
7.1
When taken from Computer Science, Faculty of Science:
6.25

Coordinator:

Dr A Moffat

Prerequisite/s:

433-141 or 433-142 (From 1998: 433-141 or 433-142 or 433-161 + 433-162)

Timetable:

Semester 2

Contact:

26 lectures, 13 tutorials

Objectives:

On completion of this subject students should: be able to reason formally about the properties of simple specifications and programs; be able to reason formally about simple models of computation; and appreciate the variety of applications of discrete mathematical techniques in computer science.

Content:

Sets and set operations, relations and functions. Logic, propositional and predicate calculus, and proof structures. Formal specification, refinement and program proof. Formal languages, grammars and recognisers. Models of computation: finite state machines, pushdown automata and Turing machines.

Assessment:

A 2-hour written examination at the end of the subject. Project work, which is expected to take about 30 hours must be completed satisfactorily to pass the subject. Weighting of assessment components will be made known at the commencement of the subject.
Search | Previous : 433-254 | Next : 433-256
Handbook 1997 : Faculty of Engineering : School of Electrical Engineering and Computer Science 
Status:                   OFFICIAL 1997
Last Modified:            Wednesday March 12 3:36 pm
SGML to HTML Conversion:  Information Technology Services
Authorised by:            Academic Registrar
Email Enquiries:          Course_Information@registrar.unimelb.edu.au
Copyright © University of Melbourne 1997.