| 1 |
Introduction |
|
| 2 |
C++, Java Review |
|
| 3 |
Basics of Performance Analysis |
|
| 4 |
Relationship between Mathematical Induction and Programming |
|
| 5 |
O(n2) Sorting Algorithms |
|
| 6 |
Merge Sort |
|
| 7 |
Quick Sort |
|
| 8 |
Sorting in Linear Time |
|
| 9 |
Randomized Sorting and Selection |
|
| 10 |
Deterministic Selection |
|
| 11 |
Basics of Data structures |
|
| 12 |
Linear List and Queue ADTs |
|
| 13 |
Stack |
|
| 14 |
Basics of Trees and Binary Trees |
|
| 15 |
Binary Tree Iteration |
|
| 16 |
Threaded and Indexed Binary Trees |
|
| 17 |
Priority Queues and Heap |
|
| 18 |
Map- Binary Search Trees and Hash Table |
|
| 19 |
Balanced Binary Trees- AVL |
|
| 20 |
B Trees |
|
| 21 |
Disjoint Sets |
|
| 22 |
Amortized Analysis |
|
| 23 |
Amortized Analysis |
|