CS 322 - Algorithms

4.00 credits.

This course provides an introduction to theoretical computer science with an emphasis on algorithm design and analysis. Divide-and-conquer approaches, dynamic programming, NP-completeness, and graph algorithms are covered. Techniques including asymptotic analysis, solving recurrence relations, and amortized analysis are discussed. The final section of the course is dedicated to theory of computation, including regular expressions and finite automata, context-free grammars, Turing machines, and decidability. *Prerequisite(s): CS 221. Spring semester, even-numbered years.