CISC 7221X
Theoretical Computer Science · 3 credits · Spring 2027
About this course
37� hours plus conference and independent work; 3 creditsOverview of theoretical computer science. Finite automata andOverview of theoretical computer science. Finite automata and pushdown automata, grammars, Turing machines, the Halting Problem, unsolvable problems. Time complexity, space complexity, complexity classes, P, NP, NP-Complete, PSPACE, EXPTIME. Prerequisite: a course in discrete structures. Not open to students who have completed a course in theoretical computer science.
No sections have been posted for this course in this term yet.