This course emphasizes fundamental algorithms, advanced methods of algorithmic design and analysis, and the use of advanced data structures. Topics include understanding of the inherent complexity of natural problems via polynomial-time algorithms, randomized algorithms, NP-completeness, on-line algorithms, graph and network flow algorithms, linear programming, approximation algorithms, tools for probabilistic analysis of algorithms.