12334 (v.4) Theoretical Foundations of Computer Science 352
| Area: | Department of Computing |
| Contact Hours: | 5.0 |
| Credits: | 25.0 |
| 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
|
| 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. |
| Year | Location | Period | Internal | Area External | Central External | | 2003 | Bentley Campus | Semester 2 | Y | | | |
Current as of: October 30, 2003 13:11:55
CRICOS provider code 00301J
