| Area: |
Department of Computing |
| Credits: |
25.0 |
| Contact Hours: |
4.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 |
| Workshop: |
1 x 2 Hours Weekly |
| |
| Syllabus: |
Algorithm techniques, algorithm analysis. Automata, recursive function theory and grammars. Mathematical basis of computation. Propositional and predicate logic, resolution and theorem proving. |
| |
| ** 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: | 20105 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 |
| Availability Information has not been provided by the respective School or Area. Prospective students should contact the School or Area listed above for further information. |
