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.6) Software Technology 152 or any previous version
AND
12333 (v.4) Design and Analysis of Algorithms 251 or any previous version
|
| |
Syllabus: |
Automata theory - deterministic and non-deterministic automata, conversions. Grammars - context free grammars, languages for grammars, Parse trees. Turning machines and abstractions of RAM. Decidabilty reducibility Pand PN classes. Time and spare complexity. 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: |
20100 Computer Science (Narrow Grouping) |
HECS Band (if applicable): |
2 |
|
Extent to which this unit or thesis
utilises online information: |
Not Online |
Result Type: |
Grade/Mark |
|
Availability |
| Year |
Location |
Period |
Internal |
Area External |
Central External |
| 2004 |
Bentley Campus |
Semester 2 |
Y |
|
|
Area
External |
refers to external course/units run by the School or Department, offered online or through Web CT, or offered by research. |
Central
External | refers to external course/units run through the Curtin Bentley-based Distance Education Area |
|
