Syllabus
Asymptotic notations Dynamic Programming
Recurrence relations Matrix Chain Multiplication
Insertion sort Longest common subsequence
Merge Sort Optimal BST
Strassen’s Matrix Multiplications 0-1 knapsack problem,
Floyd Warshall algorithm
Greedy Algorithms: String matching
Activity selection problem NP-Complete Problem
Fractional Knapsack problem
Huffman Codes
Task scheduling problem
Minimum Spanning Trees
Single source shortest path
End term 2019
End term 2018
End term 2017
End term 2016