Unit - I (Chapters - 1,2) Introduction : Algorithm definition, Algorithm specfication, Performance analysis - Space complexity, Time complexity, Randomized algorithms. Divide and Conquer : General method, Applications - Binary search, Merge sort, Quick sort, Strassen's matrix multiplication. Unit - II (Chapters - 3,6) Disjoint set operations, Union and find algorithms. AND/OR graphs, Connected components, and Spanning trees, Bi-connected components. Backtracking -general method, applications. The 8-queen problem, sum of subsets problem, Graph coloring, Hamiltonian cycles. Unit - III (Chapter - 4) Greedy Method : General method, Applications - Knapsack problem, Job sequencing with deadlines, Minimum cost spanning trees, Single source shortest path problem. Unit - IV (Chapter - 5) Dynamic Programming : General method, Applications - Chained matrix multiplication, All pairs shortest path problem, Optimal binary search trees, 0/1 Knapsack problem, Reliabiltiy design. Travelling salesperson problem, Unit - V (Chapters - 7,8) Branch and Bound : General method, Applications - 0/1 Knapsack problem - LC branch and bound solution, FIFO branch and bound solution, Travelling salesperson problem, NP-Hard and NP-Complete Problems : Basic concepts, Non-deterministic algorithms, NP-hard and NP-complete classes, Cook's theorem