Syllabus:

Recursive algorithms (median-finding and FFT), Greedy algorithms (Dijkstra's algorithm and MST algorithms),  F-heap and union-find data structure, max-flow algorithms, randomized algorithms (global min-cut, Miller-Rabin primality testing, hashing, online paging), NP-completeness and introduction to approximation algorithms