ALGORITHM AND COMPLEXITY 1
Mr. DJAMEN NYONKEU GILDAS
MODULE - I
Lecture 1 - Introduction to Design and analysis of algorithms
Lecture 2 - Growth of Functions ( Asymptotic notations)
Lecture 3 - Recurrences, Solution of Recurrences by substitution
Lecture 4 - Recursion tree method
Lecture 5 - Master Method
Lecture 6 - Design and analysis of Divide and Conquer Algorithms
Lecture 7 - Worst case analysis of merge sort, quick sort and binary search
Lecture 8 - Heaps and Heap sort
Lecture 9 - Priority Queue
Lecture 10 - Lower Bounds for Sorting
Lecture 1 - Introduction to Design and analysis of algorithms
Lecture 2 - Growth of Functions ( Asymptotic notations)
Lecture 3-5: Recurrences, Solution of Recurrences by substitution,
Recursion Tree and Master Method
Lecture 6 - Design and analysis of Divide and Conquer
Algorithms
Lecture 7: Worst case analysis of merge sort, quick sort
.
Lecture 8 - Heaps and Heap sort
MODULE -II
Lecture 11 - Dynamic Programming algorithms
Lecture 12 - Matrix Chain Multiplication
Lecture 13 - Elements of Dynamic Programming
Lecture 14 - Longest Common Subsequence
Lecture 15 - Greedy Algorithms
Lecture 16 - Activity Selection Problem
Lecture 17 - Elements of Greedy Strategy
Lecture 18 - Knapsack Problem
Lecture 19 - Fractional Knapsack Problem
Lecture 20 - Huffman Codes
