COMP 475 - Theory of Computation

3 hours
Covers the detailed comparative analysis of algorithms and their computational complexity. May also include formal language theory including finite automata, Turing machines, context-free grammars, and decidability. Offered alternate years. Prerequisite(s): COMP 250 and COMP 311. UG