Yearbooks

Theoretical computer science 210


 
Module code COS 210
Qualification Undergraduate
Faculty Faculty of Engineering, Built Environment and Information Technology
Module content

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.

Module credits 8.00
NQF Level 06
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 regulations and rules for the degrees published here are subject to change and may be amended after the publication of this information.

The General Academic Regulations (G Regulations) and General Student Rules apply to all faculties and registered students of the University, as well as all prospective students who have accepted an offer of a place at the University of Pretoria. On registering for a programme, the student bears the responsibility of ensuring that they familiarise themselves with the General Academic Regulations applicable to their registration, as well as the relevant faculty-specific and programme-specific regulations and information as stipulated in the relevant yearbook. Ignorance concerning these regulations will not be accepted as an excuse for any transgression, or basis for an exception to any of the aforementioned regulations.

Copyright © University of Pretoria 2022. All rights reserved.

COVID-19 Corona Virus South African Resource Portal

To contact the University during the COVID-19 lockdown, please send an email to [email protected]

Click here for frequently asked questions for first year UP students

FAQ's Email Us Virtual Campus Share Cookie Preferences