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. 3 lectures a week. Prerequisite: MATH 210 and (CSC 122 or ITSC 122).