Area: | Department of Computing |
Credits: | 25.0 |
Contact Hours: | 4.0 |
Tutorial: | 1 x 4 Hours Weekly |
Prerequisite(s): | 10078 (v.5) Software Technology 501 or any previous version
|
Syllabus: | Automata theory - deterministic and non-deterministic automata, conversions. Grammars - context free grammars, languages for grammars, Parse trees. P and NP classes, NP completeness and reducibility. Decidability. Turing machines and abstractions of RAM. |
| |
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 |
|
