Notion of an Algorithm – Fundamentals of Algorithmic Problem Solving – Important Problem Types –
Fundamentals of the Analysis of Algorithm Efficiency – Analysis Framework – Asymptotic Notations
and its properties – Mathematical analysis for Recursive and Nonrecursive algorithms.
BRUTE FORCE AND DIVIDE & CONQUER
Brute Force: Selection sort, Bubble Sort, Sequential Search, Closest-Pair and Convex-Hull ProblemsTraveling Salesman Problem – Knapsack Problem - Assignment problem. Divide and conquer
methodology: Merge sort – Quick sort – Binary search – Multiplication of Large Integers – Strassen’s
Matrix Multiplication
DYNAMIC PROGRAMMING AND GREEDY TECHNIQUE
Dynamic Programming: Computing a Binomial Coefficient – Warshall’s and Floyd’s algorithm –
Optimal Binary Search Trees – Knapsack Problem and Memory functions. Greedy Technique Prim’s
algorithm- Kruskal's Algorithm - Dijkstra's Algorithm-Huffman Trees – Job Sequence Scheduling
FLOW NETWORKS AND STRING MATCHING
Flow Networks-Ford Fulkerson Method-String Matching-Naive String Matching Algorithm-Knuth
Morris Pratt Algorithm-Analysis
BACKTRACKING AND BRANCH & BOUND
Limitations of Algorithm - Lower-Bound Arguments-Decision Trees-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
Reference Book:
1 Thomas H.Cormen, Charles E.Leiserson, Ronald L. Rivest and Clifford Stein, “Introduction to
Algorithms”, PHI Learning Private Limited, 3rd Edition, 2012.
2 Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, “Data Structures and Algorithms”,
Pearson Education, 2nd Edition, 2007.
3 Donald E. Knuth, “The Art of Computer Programming”, Pearson Education, 2nd Edition , 2009
4 Steven S. Skiena, “The Algorithm Design Manual”, Springer, 2nd Edition, 2008
5 Thomas H.Cormen, Charles E.Leiserson, Ronald L. Rivest and Clifford Stein, “Introduction to
Algorithms”, PHI Learning Private Limited, 3rd Edition, 2012.
Text Book:
1 Anany Levitin, “Introduction to the Design and Analysis of Algorithms”, Pearson Education, 3rd
Edition, 2014.
2 Thomas H.Cormen, Charles E.Leiserson, Ronald L. Rivest and Clifford Stein, “Introduction to
Algorithms”, PHI Learning Private Limited, 3rd Edition, 2012.
