MT3852
Automata, Languages and Complexity
2018-2019
15
7
SCQF level 9
2
Academic year(s): 2018-2019
SCOTCAT credits : 15
ECTS credits : 7
Level : SCQF level 9
Semester: 2
Availability restrictions: Not available to Joint Honours Mathematics and Computer Science students.
Planned timetable:
This module begins with finite state machines, context-free grammars and big-O notation. Turing machines, non-determinism and pushdown automata are introduced, followed by studies on decidability, simulation and the Halting problem. The complexity classes P, NP, co-NP, NP-hard, etc., are described via analysis of SAT and graph isomorphism. Strengths and limitations of the abstract approach to complexity are discussed, followed by an introduction to practical complexity.
Pre-requisite(s): Before taking this module you must pass MT2504 or ( pass CS2001 or pass CS2101 and pass CS2002 )
Anti-requisite(s): You cannot take this module if you take CS3052
Weekly contact: 2 hours of lectures (x 11 weeks), .5-hour tutorial (x 10 weeks)
Scheduled learning hours: 27
Guided independent study hours: 123
As used by St Andrews: 2-hour Written Examination = 60%, Coursework = 40%
As defined by QAA
Written examinations : 60%
Practical examinations : 0%
Coursework: 40%
Re-assessment: 2-hour Written Examination = 100%