Analysis & Design of Algorithms     Section A Spanning Tree PDF : 1789 KB     Divide and Conquer PDF : 3706 KB     Asymptotic Notation & Master Method PDF : 3706 KB     Quick Sort & Selection Sort PDF : 3706 KB     Union & Find opertion PDF : 3706 KB Binary Search PDF : 42142 KB     Graph Theory PDF : 3706 KB     Merg Short PDF : 3706 KB     Preliminary Definitions PDF : 3706 KB           Section B 0-1 Knapsack Problem PDF : 1831 KB     Dynamic Programming PDF : 70891 KB     Job Scheduling PDF : 3706 KB     Travelling Salseman Problem PDF : 3706 KB Dijkstra Single Source PDF : 62293 KB     Greedy Method PDF : 50 KB     MST PDF : 3706 KB               Section C Branch and BoundSearching Strategies PDF : 1831 KB     Hamiltonian Cycles PDF : 70891 KB     Parallelizing Quicksort PDF : 3706 KB     Some lower bounds on parallel computations PDF : 3706 KB     Introduction to Bubble Sort and its Variants PDF : 3706 KB Backtracking PDF : 62293 KB     0/1 Knapsack using Branch & Bound PDF : 50 KB     Ch: 5 Backtracking PDF : 50 KB     TSP using Branch and BoundSearching Strategies PDF : 50 KB               Section D Basic concept of NP Hard & NP Complete PDF : 1831 KB     NP Complete PDF : 1831 KB     NP and NP-Completeness PDF : 62293 KB     Hard Problems PDF : 62293 KB