A systematic study of algorithms and their complexity, including searching and sorting algorithms, mathematical algorithms, scheduling algorithms, and tree and graph traversal algorithms. The limitations of algorithms, Turing machines, the classes P and NP, NP-complete problems, and intractable problems.
(Prereq.: CSC 210, Math Placement Group IV, and one of MAT 122 or 145 or 171.)