Design And Analysis Of Algorithms

Introduction Algorithms, Analysis of algorithms, Growth of functions, Master's theorem, Designing of algorithms. Sorting and order statistics Heap sort, Quick sort, Sorting in linear time, Medians and order statistics. Advanced Data Structure Red-Black trees, Augmenting data structure. B-trees, Binomial heaps, Fibonacci heaps, Data structure for disjoint sets. Advanced Design and Analysis Techniques Dynamic programming, Greedy algorithms, Amortized analysis, Back tracking. Graph Algorithms Elementary graphs algorithms, Minimum spanning trees, Single-source shortest paths, All-pairs shortest paths, Maximum flow, Traveling salesman problem. Selected Topics Randomized algorithms, String matching, NP completeness, Approximation algorithms.