CS405. ALGORITHM Analysis 

Class Overview

This course consists of advanced topics in the analysis and design of algorithms and data structures, including complexity analysis, amortized analysis, randomized algorithms, dynamic programming, advanced data structures such as skip list and interval trees, NP-completeness, approximation algorithms, linear programming and graph algorithms such as network flow, matching, and planarity testing.