UNIT 1:
Introduction, Notion of an Algorithm
Introduction, Notion of an Algorithm
Fundamentals of Algorithmic Problem Solving
Fundamentals of the Analysis of Algorithm Efficiency
Asymptotic Notations and its properties
Mathematical Analysis for Recursive Algorithm
Mathematical Analysis for Non-recursive Algorithms
UNIT 2:
Closest-Pair and Convex-Hull Problems
Brute Force: Selection Sort, Bubble Sort
Traveling Salesman Problem
Knapsack Problem- Assignment problem
Knapsack Problem- Assignment problem
Divide and Conquer Methodology: Merge Sort
Multiplication of Large Integers- Strassen’s Matrix Multiplication
Multiplication of Large Integers- Strassen’s Matrix Multiplication
UNIT 3:
Dynamic Programming: Computing a Binomial Coefficient
Optimal Binary Search Trees
Knapsack Problem and Memory Functions
Greedy Technique: Prim’s Algorithm
Huffman Trees- Job Sequence Scheduling
Huffman Trees- Job Sequence Scheduling
UNIT 4:
Navie String Matching Algorithm
Knuth Morris Pratt Algorithm
UNIT 5:
Limitations of Algorithm, Lower-Bound Arguments
Traveling Salesman Problem
Branch and Bound: Assignment Problem
Hamiltonian Circuit Problem, Subset Sum Problem
Coping with the Limitations- Backtracking: n-Queens problem
