Design and Analysis of Algorithm

Algorithm analysis - Time space tradeoff - Asymptotic notations - Conditional asymptotic notation - Removing condition from the conditional asymptotic notation - Properties of big-Oh notation -Recurrence equations - Solving recurrence equations - Analysis of linear search. Divide and Conquer : General method - Binary search - Finding maximum and minimum - Merge sort - Greedy algorithms ; General method - Container loading - Knapsack problem. Dynamic programming : General method - Multistage graphs - All-pair shortest paths - Optimal binary search trees - 0/1 Knapsack - Travelling salesperson problem. Backtracking : General method - 8 Queens problem - Sum of subsets - Graph coloring - Hamiltonian problem - Knapsack problem. Graph traversals - Connected components - Spanning trees - Biconnected components - Branch and bound : General methods (FIFO and LC) - 0/1 Knapsack problem - Introduction to NP-hard and NP-completeness.