| 11-October-2021 |
1.5 hours |
Introduction to Algorithm |
|
|
|
1.5 hours |
Structured description of algorithm, Three Examples of Algorithms |
|
|
| 18-October-2021 |
1.5 hours |
Algorithm Analysis (Algorithm Correctness) |
Quiz 1 |
|
|
1.5 hours |
Algorithm Analysis (Algorithm Efficiency) |
Assignment 1 |
|
| 25-October-2021 |
1.5 hours |
Growth of Functions: Asymptotic notation and examples of Big Oh, Big Omega, and Theta. |
|
|
|
1.5 hours |
Sorting Problem: Insertion Sort |
Quiz 2 |
|
| 1-November-2021 |
1.5 hours |
Analysis of Insertion Sort, Loop invariants of Insertion Sort. |
Assignment 2 |
|
|
1.5 hours |
Divide-and-Conquer Approach: Merge Sort: Example, Complete Working |
|
|
| 8-November-2021 |
1.5 hours |
Quick Sort: Example, Complete Working |
|
|
|
1.5 hours |
Heap Sort: Heaps, Maintaining the Heap property |
|
|
| 15-November-2021 |
1.5 hours |
Heap Sort: Building a Heap, The Heap Sort algorithm Sorting in Sorting in Linear Time: Radix sort |
Quiz 3 |
|
|
1.5 hours |
Linear Time: Bucket sort Sorting in Linear Time: Counting sort |
Assignment 3 |
|
| 22-November-2021 |
1.5 hours |
The substitution method for solving recurrences, The master method for solving recurrences |
|
|
|
1.5 hours |
The recursion-tree method for solving recurrences |
|
|
| 29-November-2021 |
1 Hour |
Mid Term |
|
|
| 6-December-2021 |
1.5 hours |
Dynamic Programming Element of the dynamic programming |
|
|
|
1.5 hours |
Matrix Chain Multiplication |
|
|
| 13-December-2021 |
1.5 hours |
Greedy Algorithms Activity Selection Problem |
|
|
|
1.5 hours |
Element of the greedy strategy |
|
|
| 20-December-2021 |
1.5 hours |
Greedy Vs Dynamic programming Knapsack Problem |
|
|
|
1.5 hours |
Huffman Trees and Codes |
|
|
| 27-December-2021 |
1.5 hours |
Huffman Trees and Codes |
|
|
|
1.5 hours |
Elementary Graph Algorithms Representation of graph |
|
|
| 3-January-2022 |
1.5 hours |
Breadth-First Search Depth-First Search |
|
|
|
1.5 hours |
Topological Sort |
|
|
| 10-January-2022 |
1.5 hours |
Minimum Spanning Tree |
Quiz 4 |
|
|
1.5 hours |
Growing a Minimum Spanning Tree |
Assignment 4 |
|
| 17-January-2022 |
1.5 hours |
Kruskal’s Algorithm Example |
|
|
|
1.5 hours |
Prim’s Algorithm Example |
|
|
| 24-January-2022 |
1.5 hours |
Single-Source Shortest Paths |
|
|
|
1.5 hours |
Single-Source Shortest Paths in DAG Dijkstra’s Algorithm |
|
|
| 31-January-2022 |
2 Hour |
Final Term |
|
|
