302976 (v.1) Theoretical Foundations of Computer Science 552
Area: | Department of Computing |
---|---|
Credits: | 25.0 |
Contact Hours: | 4.0 |
Tuition Patterns: | The tuition pattern provides details of the types of classes and their duration. This is to be used as a guide only. Precise information is included in the unit outline. |
Tutorial: | 1 x 4 Hours Weekly |
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 P and PN classes. Time and spare complexity. NP completeness. |
Unit references, texts, outcomes and assessment details | The most up-to-date information about unit references, texts and outcomes, will be provided in the unit outline. |
Field of Education: | 020105 Computational Theory |
Result Type: | Grade/Mark |
Availability
Year | Location | Period | Internal | Partially Online Internal | Area External | Central External | Fully Online |
---|---|---|---|---|---|---|---|
2012 | Bentley Campus | Semester 2 | Y |
Area External refers to external course/units run by the School or Department or offered by research.
Central External refers to external and online course/units run through the Curtin Bentley-based Distance Education Area
Partially Online Internal refers to some (a portion of) learning provided by interacting with or downloading pre-packaged material from the Internet but with regular and ongoing participation with a face-to-face component retained. Excludes partially online internal course/units run through the Curtin Bentley-based Distance Education Area which remain Central External
Fully Online refers to the main (larger portion of) mode of learning provided via Internet interaction (including the downloading of pre-packaged material on the Internet). Excludes online course/units run through the Curtin Bentley-based Distance Education Area which remain Central External