| |
date |
viewing |
printing |
notes |
| Lecture 1 |
July 17 |
pdf,
pdf |
pdf,
pdf |
Algorithms |
| Lecture 2 |
July 18 |
pdf |
pdf
| Asymptotics 1 |
| Lecture 3 |
July 19 |
pdf |
pdf |
Asymptotics 2 |
| Lecture 4 |
July 24 |
pdf |
pdf |
Summations |
| Lecture 5 |
July 25 |
pdf |
pdf |
Recurrences |
| Lecture 6 |
July 26 |
pdf |
pdf |
Min & Max; Selection 1 |
| Lecture 7 |
July 31 |
pdf |
pdf |
Selection 2; Quicksort |
| No lecture |
August 1 |
|
|
|
| Lecture 8 |
August 2 |
pdf |
pdf |
Sorting; Dynamic Programming 1 |
| Lecture 9 |
August 7 |
pdf |
pdf |
Dynamic Programming 2 |
| Lecture 10 |
August 8 |
pdf |
pdf |
Matrix multiplication |
| Lecture 11 |
August 9 |
pdf |
pdf |
LCS, Greedy Algorithms 1 |
| Lecture 12 |
August 14 |
pdf |
pdf |
Greedy Algorithms 2 |
| No lecture |
August 15 |
|
|
|
| Lecture 13 |
August 16 |
pdf |
pdf |
Heaps and priority queues |
| Lecture 14 |
August 21 |
pdf,
ppt |
pdf |
Priority queues, hashing |
| Lecture 15 |
August 22 |
pdf,
ppt |
pdf |
Hashing |
| Lecture 16 |
August 23 |
pdf,
ppt |
pdf |
Binary search trees |
| No lecture |
August 28 |
|
|
|
| Lecture 17 |
August 29 |
pdf |
pdf |
Red-black trees |
| Lecture 18 |
August 30 |
pdf |
pdf |
Red-black trees; indexed sets |
| Lecture 19 |
September 18 |
pdf |
pdf |
Disjoint sets |
| Lecture 20 |
September 19 |
pdf |
pdf |
BFS |
| Lecture 21 |
September 20 |
pdf |
pdf |
DFS; topological sorting |
| Lecture 22 |
October 2 |
pdf,
ppt,
ppt,
ppt |
pdf |
Spanning Trees; Kruskal's Algorithm; Prim's Algorithm |
| Lecture 23 |
October 3 |
pdf,
ppt |
pdf |
Single-Source Shortest Paths (SSPs); Dijkstra's Algorithm |
| Lecture 24 |
October 4 |
pdf |
pdf |
SSPs; Bellman-Ford Algorithm; DAGs; Difference Constraints |
| Lecture 25 |
October 9 |
pdf |
pdf |
All-pairs shortest parts |
| Lecture 26 |
October 10 |
pdf |
pdf |
Strongly-connected components; bridges and separating vertices |
| Lecture 27 |
October 11 |
pdf |
pdf |
Fast matrix multiplication; RSA public key encryption |