Theoretical computer science 210

Modulekode COS 210
Kwalifikasie Undergraduate
Fakulteit Faculty of Engineering, Built Environment and Information Technology

This module introduces students to a framework for investigating both computability and complexity of problems. Topics include, but are not limited to: finite-state machines, regular expressions and their application in a language such as awk, the Halting problem, context-free grammars, P vs NP problem, NP-complete class, reduction techniques, regular languages, DFAs and NFAs, Lattices, Church-Turing thesis.

Modulekrediete 8.00
Prerequisites COS 110 and COS 151
Contact time 1 practical per week, 2 lectures per week
Language of tuition Module is presented in English
Department Computer Science
Period of presentation Semester 1

The information published here is subject to change and may be amended after the publication of this information. The General Regulations (G Regulations) apply to all faculties of the University of Pretoria. It is expected of each student to familiarise himself or herself well with these regulations as well as with the information contained in the General Rules section. Ignorance concerning these regulations and rules will not be accepted as an excuse for any transgression.

Copyright © University of Pretoria 2020. All rights reserved.

FAQ's Email Us Virtual Campus Share Cookie Preferences