Unit-I
Algorithms-analyzing algorithms, designing algorithms
Sorting and order statistics-heap sort, quick sort, sorting in linear time, medians and order statistics

Unit-II
Data structures-elementary data structures, hash tables, binary search trees, red-black trees, augmenting data structures

Unit-III
Advanced data structures-Btrees, binomial heaps,fibonacci heaps, data structures for disjoint sets

Unit-IV
Advanced design and analysis techniques-dynamic programming, greedy algorithms, amoritized analysis
Graph algorithms-elementary graph algorithms, minimal spanning tree, single source
Shortest paths all pair shortest paths

Unit-V
String matching, number theoretic algorithms, computational geometry


Suggested readings
Introduction to algorithms-Ronald Rivest,Thomas