Week - 1 |
Introduction, Mathematical Background, Asymptotic Notations |
Week - 2 |
Iterative sorting algorithms:
BubbleSort, SelectionSort, InsertSort |
Week - 3 |
Recursive Algorithms: MergeSort, QuickSort, Medians |
Week - 4 |
Heaps and HeapSort |
Week - 5 |
Linear Sorting Algorithms: CountingSort and RadixSort |
Week - 6 |
MIDTERM I |
Week - 7 |
Binary Search Trees, AVL Trees and Splay Trees |
Week - 8 |
B Trees and Applications |
Week - 9 |
Union/Find Data Structure |
Week - 10 |
Graphs: BFS, DFS |
Week - 11 |
Topological Sort |
Week - 12 |
MIDTERM II |
Week - 13 |
Minimum Spanning Trees |
Week - 14 |
Shortest Path Algorithms |