| Day |
Topic |
Notes |
Last Updated |
Readings |
| Oct 23 - Oct 26 |
Introduction, Complexity, Notations, Recurrences |
pdf
ps |
Oct 23 |
Chapters 0, 1.1, 2.1 + extra |
| Oct 29 - Nov 2 |
Sorting Algorithms, including Heap Sort, Median |
pdf
ps |
Oct 23 |
Chapters 2.3, 4.5, 2.4 + extra |
| Nov 5 - Nov 9 |
Dynamic Programming |
pdf
ps |
Oct 23 |
Chapters 6.2, 6.3, 6.4, 6.5 |
| Nov 12 - Nov 15 |
Greedy Algorithms |
pdf
ps |
Oct 23 |
Chapters 5.2 + extra |
| Nov 16 |
Midterm |
|
|
|
| Nov 19 - Nov 20 |
Graphs/Trees Introduction |
Graphs
Trees
| Oct 23 |
Section 3.1 |
| Nov 26 - Nov 27 |
Graph Traversal - DFS, BFS |
pdf
| Oct 23 |
Chapter 3, 4.1, 4.2 |
| Nov 29 - Nov 30 |
Minimum Spanning Trees |
Book chapter 5.1 (except "Path Compression" and "Randomized algorithm for
min cut")
pdf |
Oct 23 |
Chapters 5.1 |
| Dec 3 - Dec 7 |
Shortest Paths |
pdf
ps |
Oct 23 |
Chapters 4, 6.1, 6.6 |
| Dec 10 - Dec 11 |
NP-Completeness |
pdf
ps |
Oct 23 |
Chapter 8 |
| Dec 13 |
Final Exam |
|
|
|