A study of the design and analysis of algorithms for solving problems, including dynamic programming, divide-and-conquer algorithms, greedy algorithms, graph algorithms, and search algorithms. Evaluation of time-space trade-offs.

Prerequisite: (COSC 240 with a minimum grade of D or MATH 260 with a minimum grade of D) and COSC 350 with a minimum grade of C.