The course focuses on well-known classes of algorithms, and on patterns underlying algorithm (not object) design. Classes of algorithms studied should include divide-and-conquer algorithms, greedy algorithms, dynamic programming, search algorithms, and classic graph algorithms. Patterns studied will include a fuller treatment of algorithm analysis and space-time tradeoffs.
Prerequisite Courses
Notes
Quantitative GEP credit