Nation of an Algorithm- Fundamentals of Algorithmic Problem Solving –Important Problem Type –Fundamentals of the Analysis of Algorithm Efficiency-Analysis Framework –Asymptotic Notations and its properties –Mathematical analysis for Recursive and Non –recursive algorithm
Brute Force- Closest- Pair and Convex-Hull Problems-Exhaustive Search-Travelling Salesman Problem- Knapsack Problem- Assignment Problem. Divide and conquer methodology- Merge Sort-Quick Sort-Binary Search-Multiplication of Large Integers-Strassen’s Matrix Multiplication-Clos Pair and Convex- Hull Problems
Computing a Binomial Coefficient- Warshalls and Floyd algorithm –Optimal Binary Search Trees- Knapsack Problems and Memory Functions. Greedy Technique-Prim’s algorithm-Kruskal’s algorithm-Dijkstra’s Algorithm-Huffman Trees
The Simplex Method –The Maximum-Flow Problem- Maximum Matching in Bipartite Graphs- The Stable marriage Problem.
Limitations of Algorithm Power-Lower-Bound Arguments-Decision Tree-P, NP and NP-Complete Problems-Coping with the limitations-Backtracking –n-Queens problem-Hamiltonian Circuit Problem-Subset Sum Problem-Branch and Bound-Assignment Problem-knapsack problem-Traveling salesman Problem-Approximation Algorithms for NP-Hard Problems-Traveling Salesman Problem-Knapsack problem.
Reference Book:
1. Thomas H. Cormen, Charles E.Leiserson, Ronald L Rivest and Clifford Stein, “Introduction to Algorithm”, Third Edition, PHI Learning Private Limited 2012. 2. Alfred V.Aho,John E.Hopcroft and Jeffrey D.Ullman,”Data Structures and Algorithms”, Pearson Education, Reprint 2006. 3. Donald E. Knuth,” The Art of Computer Programming”, Volumes 1&3 Pearson Education,2009. 4. Steven S. Skiena, “The Algorithm Design Manual”, Second Edition, Springer,2008
Text Book:
Anany Levitin,” Introduction to the Design and Analysis of Algorithms”, Third Edition, Pearson Eduction,2012
