| 21-March-2022 |
1.5 hours |
Introduction to course |
Assignment # 1 |
|
|
1.5 hours |
Logic and Proving Techniques |
|
|
| 28-March-2022 |
1.5 hours |
Asymptotic order of growth |
|
|
|
1.5 hours |
Recursive Exponentiation |
Task: comparison between sorting and stable sorting |
|
| 4-April-2022 |
1.5 hours |
Sorting Algorithm: Brute Force Approach |
|
|
|
1.5 hours |
Design of Algorithms using Brute Force Approach |
|
|
| 11-April-2022 |
1.5 hours |
Designing Algorithms using Divide-and-Conquer Multiplication, recurrence relations |
Assignment # 1 Identifying Problem |
|
|
1.5 hours |
Generating Permutations, 0-1 Knapsack Algorithm Analysis |
|
|
| 18-April-2022 |
1.5 hours |
Greedy Algorithms: Analysis of Merge-sort and Quick Sort Algorithm |
Research support for Assign problem |
|
|
1.5 hours |
Substitution Method, Recursion-Tree Method, Master Therom |
|
|
| 25-April-2022 |
1.5 hours |
Dynamic Programming |
|
|
|
1.5 hours |
Dynamic Programming for Solving Optimization Problems |
|
|
| 2-May-2022 |
1.5 hours |
Linear Vs Non-linear Data Structures |
|
|
|
1.5 hours |
Matrix Chain Multiplication Problem |
|
|
| 9-May-2022 |
1 Hour |
Mid Term |
|
|
| 16-May-2022 |
1.5 hours |
Graph Theory and Types of Graphs |
Quiz # 1 |
|
|
1.5 hours |
BFS and DFS |
|
|
| 23-May-2022 |
1.5 hours |
Paths in Graphs |
|
|
|
1.5 hours |
Breadth-first search, Dijkstra’s algorithm, |
|
|
| 30-May-2022 |
1.5 hours |
heaps, Bellman-Ford algorithm |
|
|
|
1.5 hours |
shortest paths in DAGs |
Quiz # 2 |
|
| 6-June-2022 |
1.5 hours |
Greedy Algorithms |
|
|
|
1.5 hours |
Minimum spanning trees, Huffman encoding, |
|
|
| 13-June-2022 |
1.5 hours |
Horn formulas, |
|
|
|
1.5 hours |
set cover (approximation algorithm) |
Submission of Assignment |
|
| 20-June-2022 |
1.5 hours |
Dynamic Programming |
|
|
|
1.5 hours |
Shortest paths in DAGs (revisited), |
|
|
| 27-June-2022 |
1.5 hours |
longest increasing subsequence |
|
|
|
1.5 hours |
edit distance, knapsack problem |
Quiz # 4 |
|
| 4-July-2022 |
1.5 hours |
Complexity Theory |
|
|
|
1.5 hours |
Turing machine |
|
|
| 11-July-2022 |
2 Hour |
Final Term |
|
|
