Advanced algorithms and complexity analysis. Dynamic programming; greedy algorithms; amortized analysis; shortest path and network flow graph algorithms; NP-completeness; approximation algorithms; ...

Lower bounds, NP-completeness, intractability. This course provides students with a fundamental introduction to data structures and the design and analysis of algorithms. It covers a range of data ...