Faculty of Information Technology
Refer to the specific census and withdrawal dates for the semester(s) in which this unit is offered.
This unit gives an introduction to formal languages, basic logic programming, models of computation, and computational complexity. It looks at what computers can and cannot compute. Topics include finite state automata, regular expressions, grammars, computable functions, Turing machines, polynomial-time reductions, and NP-completeness.
At the completion of this unit, students should be able to:
Examination (3 hours): 70%; In-semester assessment: 30%
Minimum total expected workload equals 12 hours per week comprising:
(a.) Contact hours for on-campus students:
(b.) Additional requirements (all students):
See also Unit timetable information
FIT1029 and 6 points of level 1 (or above) mathematics