Advanced Algorithms

Catalog description

Advanced topics in data structures and computational complexity, including randomized algorithms, dynamic programming, recurrence relations, amortized analysis, network flow algorithms, and approximation algorithms and NP-completeness will be discussed. This course covers both fundamental techniques and applications. Instructor approval required to register.