Week - 1 |
Introduction, Mathematical Background, Asymptotic Notations |
Week - 2 |
Iterative sorting algorithms:
BubbleSort, SelectionSort, InsertSort |
Week - 3 |
Recursive Algorithms: MergeSort, QuickSort, Medians |
Week - 4 |
Recursive Algorithms: MergeSort, QuickSort, Medians |
Week - 5 |
Heaps and HeapSort |
Week - 6 |
Lower Bounds on Comparison-based Sorting Algorithms
Linear Time Sorting Algorithms: Counting Sort and Radix Sort |
Week - 7 |
MIDTERM |
Week - 8 |
Graphs: BFS, DFS |
Week - 9 |
Union/Find Data Structure |
Week - 10 |
Topological Sort |
Week - 11 |
Minimum Spanning Trees |
Week - 12 |
Shortest Path Algorithms |
Week - 13 |
ClosestPair-ConvexHull-FarthestPair |
Week - 14 |
Greedy Algorithms: Activity Selection Problem, Huffman Coding |