Note for Design And Analysis Of Algorithm - DAA By SUDHANSU RANJAN LENKA

Introduction to design and analysis of algorithms

Growth of Functions (Asymptotic notations, standard notations and common functions)

Recurrences, solution of recurrences by substitution, recursion tree

Master methods, worst case analysis of Merge sort, Quick sort and Binary search, Design & Analysis of Divide and conquer algorithms

Heaps, Building a heap, The heapsort algorithm, Priority Queue, Lower bounds for sorting

Dynamic programming algorithms (Matrix-chain multiplication, Elements of dynamic programming, Longest common subsequence)

Greedy Algorithms - (Assembly-line scheduling, Achivity- selection Problem, Elements of Greedy strategy, Fractional knapsac problem, Huffman codes)

Data structure for disjoint sets:- Disjoint set operations, Linked list representation, Disjoint set forests

Graph Algorithms Breadth first and depth-first search

Minimum Spanning Trees, Kruskal and Prim's algorithms, single- source shortest paths (Bellman-ford Algorithm)

Dijkstra's algorithms

All-pairs shortest paths (Floyd – Warshall Algorithm)