Design and Analysis of Algorithms

Catalog description

An introduction to algorithm design techniques and the mathematical analysis of algorithms. Techniques covered include divide-and-conquer, greedy, backtracking, network flow and dynamic programming. The classes P and NP are introduced and intractable problems are discussed. This is a proof-intensive course. Students may not receive credit for both CS 412 and CS 452 .