433-255 Logic and Computation

Note

From 2007 this subject will be offered in Semester 2 only.

Credit Points

12.5

Prerequisites

433-172 Algorithmic Problem Solving or 433-152 Algorithmic Problem Solving (Advanced) or equivalent (prior to 2003, 433-141 Computing Fundamentals A).

Semester

2 (view timetable)

Contact

Thirty hours of lectures, 11 hours of tutorials and 6 hours of practice classes

Subject Description

The objectives of this subject are for students to be able to reason formally about the properties of simple specifications and programs; to be able to reason formally about simple models of computation; to appreciate the variety of applications of discrete mathematical techniques in computer science; and to gain working experience with a logic programming language.

Topics include logic: propositional and predicate calculus, proof structures; logic programming languages (Prolog); formal specification, refinement and program proof; and selected topics from the Chomsky hierarchy of languages, computability, and computational complexity.

Generic Skills

  • ability to apply knowledge of basic science and engineering fundamentals

  • in-depth technical competence in at least one engineering discipline

  • ability to undertake problem identification, formulation and solution

  • capacity for independent critical thought, rational inquiry and self-directed learning

Assessment

Project work during semester, expected to take about 36 hours (30%); and a 2-hour end-of-semester written examination (70%). To pass the subject, students must obtain at least 50% overall, 15/30 in project work, and 35/70 in the written examination.



Status:                   Official 2007
Last Modified:            Tuesday October 31 22:20
SGML to HTML Conversion:  Information Division - CWIS (SDI)
Authorised by:            Academic Registrar
Enquiries:                http://unimelb.custhelp.com/

Valid CSS! Valid XHTML 1.0!