Area: |
Department of Computing | ||||||||||||||||||||||||||||||||
Credits: |
25.0 | ||||||||||||||||||||||||||||||||
Contact Hours: |
5.0 | ||||||||||||||||||||||||||||||||
** The tuition pattern below provides details of the types of classes and their duration. This is to be used as a guide only. For more precise information please check your unit outline. ** | |||||||||||||||||||||||||||||||||
Lecture: |
1 x 2 Hours Weekly | ||||||||||||||||||||||||||||||||
Tutorial: |
1 x 3 Hours Weekly | ||||||||||||||||||||||||||||||||
Prerequisite(s): |
1922 (v.7) Software Technology 152 or any previous version AND 12333 (v.5) Design and Analysis of Algorithms 251 or any previous version |
||||||||||||||||||||||||||||||||
Syllabus: |
Automata theory - deterministic and non-deterministic automata and conversions. Grammars - context free grammars, languages for grammars and Parse trees. Turing machines and abstractions of RAM. Decidability, reducibility Pand PN classes. Time and sparecomplexity. NP completeness. | ||||||||||||||||||||||||||||||||
** To ensure that the most up-to-date information about unit references, texts and outcomes appears, they will be provided in your unit outline prior to commencement. ** | |||||||||||||||||||||||||||||||||
Field of Education: | 020105 Computational Theory | ||||||||||||||||||||||||||||||||
Funding Cluster: | 06 - Computing, Built Environment, Health | ||||||||||||||||||||||||||||||||
SOLT (Online) Definitions*: | Not Online *Extent to which this unit or thesis utilises online information | ||||||||||||||||||||||||||||||||
Result Type: | Grade/Mark | ||||||||||||||||||||||||||||||||
Availability |
|||||||||||||||||||||||||||||||||
|