| Lecture No. | Description | Lecture By |
|---|---|---|
| Lecture 1 | Notion of Algorithm, Growth of functions | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 2 | Summations, Recurrences: The substitution method, The iteration method | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 3 | Asymptotic Notations | Lecture by Dr. Krishna Bati Singha , Lecture by , Lecture by , Lecture by |
| Lecture 4 | Basic Efficiency Classes-1 | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 5 | Basic Efficiency Classes-2 | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 6 | Use of Big O , θ, _ in analysis-1 | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 7 | Use of Big O , θ, _ in analysis-2 | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 8 | Mathematical Analysis of few Non-recursive | Lecture by Dr. Krishna Bati Singha, Lecture by , Lecture by , Lecture by |
| Lecture 9 | Recursive Algorithms, Mathematical Analysis of Non Recursive & R A | Lecture by Dr. Krishna Bati Singha, Lecture by , Lecture by , Lecture by |
| Lecture 10 | Proof of Correctness | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 11 | Sorting and Searching Techniques Selection Sort , Bubble Sort | Lecture by Dr. Krishna Singha , Lecture by , Lecture by , Lecture by |
| Lecture 12 | Insertion Sort , Sequential Search Binary Search | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 13 | Depth first Search and Breadth First Search | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 14 | Balanced Search trees , AVL Trees | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 15 | Red-Black trees | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 16 | Heaps and Heap sort | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 17 | Hash Tables, disjoint set and their implementation | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 18 | Divide and conquer Paradigm of Problem solving | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 19 | complexity analysis and understanding of Merge sort , Quick Sort | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 20 | Binary Search Trees, Sorting in linear time | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 21 | Medians and Order statistics | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 22 | Greedy Techniques, Prim’s Algorithm, Kruskal’s Algorithm | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 23 | Dijkstra’s and Bellman Ford Algorithm , Huffman trees. Knapsack Problem | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 24 | Dynamic Programming paradigm | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 25 | Warshall’s and Floyd’s Algorithm | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 26 | Optimal Binary Search trees | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 27 | Matrix multiplication Problem , 0/1 | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 28 | Knapsack Problem , maximum network flow problem | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 29 | naive string matching algorithm | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 30 | string matching with finite automata | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 31 | Knuth morris Pratt algorithm | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 32 | The Rabin-Karp Algorithm | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 33 | Backtracking, n-Queen’s Problem | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 34 | Hamiltonian Circuit problem | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 35 | Subset-Sum problem, Branch and bound | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 36 | Assignment problem | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 37 | Travelling salesman problem | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 38 | Introduction to Computability | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 39 | Polynomial-time verification | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 40 | NP-Completeness and Reducibility | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 41 | NP-Completeness Proof-1 | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 42 | NP-Completeness Proof-2 | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 43 | NP Complete problems-1 | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 44 | NP Complete problems-2 | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 45 | Proof of cook’s theorem | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 46 | Proving Algoritham Correctness | Lecture by Dr. Krishna Bati Singha, Lecture by , Lecture by , Lecture by |
| Lecture 47 | Proving algorithm’s C | Lecture by Dr. Krishna Bati Singha, Lecture by , Lecture by , Lecture by |