Algorithmic Design
Full course description
Section titled “Full course description”Following Data Structures and Algorithms, this course develops algorithm design and analysis through greedy algorithms, dynamic programming, the master theorem, NP-completeness, backtracking, linear programming, and branch-and-bound.
Prerequisites
Section titled “Prerequisites”Desired prior knowledge: Data Structures and Algorithms and Discrete Mathematics.
Recommended reading
Section titled “Recommended reading”Goodrich and Tamassia, Algorithm Design and Applications (2015).