Characteristics of algorithm, Analysis of algorithm : Asymptotic analysis of complexity bounds - best, average and worst-case behaviour, Performance measurements of Algorithm, randomized algorithms.
Divide and Conquer : General method, Binary Search, Merge sort, Quick Sort, Strassen's matrix multiplication.

General method, Minimum cost Spanning Trees, Knapsack problem.
Dynamic Programming : General Method, Optimal binary search trees, 0/1 knapsack, The travelling sales person problem.

Techniques for binary trees, Techniques for Graphs, connected components and Spanning trees, Bi-connected components and DFS.

The method, Travelling salesperson, 0/1 Knapsack problem, Efficiency considerations.

Computability of Algorithms, Computability classes - P, NP, NP- complete and NP-hard, Cook's theorem, Standard NP-complete problems and Reduction techniques.