| Modulekode | COS 211 |
| Kwalifikasie | Voorgraads |
| Fakulteit | Fakulteit Natuur- en Landbouwetenskappe |
| Module-inhoud | *Hierdie inligting is slegs in Engels beskikbaar. 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, context-free grammars, Church-Turing thesis. |
| Modulekrediete | 8.00 |
| Programme |
|
| Voorvereistes | COS 110 en COS 151 |
| Kontaktyd | 2 lesings per week, 1 praktiese sessie per week |
| Onderrigtaal | Module word in Engels aangebied |
| Departement | Rekenaarwetenskap |
| Aanbiedingstydperk | Semester 1 |
Copyright © University of Pretoria 2025. All rights reserved.
Virtual Campus
Get Social With Us
Download the UP Mobile App