Characteristics of Algorithm, Performance Analysis: Space and Time Complexity, Asymptotic Notations-Big Oh,Omega and Theta, Divide and Conquer: General Method, Binary Search, Quick Sort, Merge Sort. Greedy Method: General Method, applications: Knapsack Problem, Single source shortest path problem, Minimum cost spanning trees. Dynamic Programming: General Method, applications-0/1 knapsack problem, all pairs shortest path problem, travelling sales person problem. Back Tracking: GeneralMethod. Application-Graph Colouring problem. Branch and Bound: General Method, Travelling salesperson problem-LCBB Solution.NP Hard and NP Complete Problems.
