CSC 420 Theory of Computation
Covers the detailed comparative analysis of algorithms and their computational complexity. May also include formal language theory including finite automata, Turning machines, context-free grammars, and decidability. Three lectures a week.