|Module code||COS 210|
|Faculty||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.
|Prerequisites||COS 110 and COS 151|
|Contact time||2 lectures per week, 1 practical per week|
|Language of tuition||Module is presented in English|
|Period of presentation||Semester 1|
Copyright © University of Pretoria 2023. 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]
Get Social With Us
Download the UP Mobile App