| Lecture | Unit No. | Name of the Topic |
| Lecture1 |
I
| Introduction to Algorithms |
| Lecture2 | Algorithm Specifications |
| Lecture3 | Types of Algorithms |
| Lecture4 | Time Complexity |
| Lecture5 | Time Complexity |
| Lecture 6 | Time Complexity |
| Lecture7 | Space Complexity |
| Lecture 8 | Asymptotic Notations |
| Lecture 9 | Master's Theorem with Proof |
| Lecture 10 | Amortized Analysis |
| Lecture 11 | Amortized Analysis |
| Lecture 12 | Sorting in Linear time |
| Lecture 13 | Sorting in Linear time |
| Lecture 14 | Revision |
| Lecture 15 |
II
| D&C General Method |
| Lecture 16 | Binary Search |
| Lecture 17 | Defective Chess Board |
| Lecture 18 | Finding Max. and Min. |
| Lecture 19 | Quick Sort |
| Lecture 20 | Quick Sort |
| Lecture 21 | Merge Sort |
| Lecture 22 | Merge Sort |
| Lecture 23 | Matrix Multiplication - Block |
| Lecture 24 | Matrix Multiplication - Strassen's |
| Lecture 25 | Revision |
| Lecture 26 |
III
| Greedy - General Method |
| Lecture 27 | Job sequencing with deadlines |
| Lecture 28 | knapsack problem |
| Lecture 29 | knapsack problem |
| Lecture 30 | Single source shortest path problem, |
| Lecture 31 | Optimal Merge Patterns |
| Lecture 32 | Optimal Merge Patterns |
| Lecture 33 | Introduction to Probabilistic analysis: |
| Lecture 34 | The Hiring Problem |
| Lecture 35 | Indicator random variables |
| Lecture 36 | Randomized Quick Sort |
| Lecture 37 | Randomly built binary search trees |
| Lecture 38 | Revision |
| Lecture 39 |
IV
| DP - General Method |
| Lecture 40 | Matrix Chain Multiplication |
| Lecture 41 | 0/1 Knapsack Problem |
| Lecture 42 | All Pairs Shortest Path Problem |
| Lecture 43 | TSP |
| Lecture 44 | String Editing |
| Lecture 45 | String Editing |
| Lecture 46 | Reliability Design |
| Lecture 47 | Reliability Design |
| Lecture 48 | Multi-Threaded Algorithms: |
| Lecture 49 | Basics |
| Lecture 50 | Multi-Threaded Matrix Multiplication |
| Lecture 51 | Multi-Threaded Merge Sort |
| Lecture 52 | Revision |
| Lecture 53 |
V
| Backtracking - General Method |
| Lecture 54 | Backtracking - General Method |
| Lecture 55 | N-Queens Problem |
| Lecture 56 | N-Queens Problem |
| Lecture 57 | Sum of Subsets Problem |
| Lecture 58 | Sum of Subsets Problem |
| Lecture 59 | Control Abstraction for LC -Search |
| Lecture 60 | LC-Search for 15 Puzzle Problem |
| Lecture 61 | Control Abstraction for FIFO -Search |
| Lecture 62 | Control Abstraction for LIFO - Search |
| Lecture 63 | Introduction to NP-Hard |
| Lecture 64 | Introduction to NP-Completeness |
| Lecture 65 | Revision |
