|
|
|
|
Week
|
Topic
|
Questions
|
Solutions
|
|
2
|
Review
of Asymptotic Notations
|
|
|
|
3
|
Review of recurrences, simple divide-and-conquer
|
|
|
|
4
|
Master theorem, randomized algorithms
|
|
|
|
5
|
Randomized algorithms
|
|
|
|
6
|
Priority queues, Sorting
|
|
|
|
7
|
Greedy algorithms |
|
|
|
8
|
No tutorials |
-
|
-
|
|
9
|
Dynamic programming algorithms |
|
|
|
10
|
Dynamic programming algorithm, Graphs |
|
|
|
11
|
BFS, DFS, Minimum spanning tree, Shortest path
|
|
|
|
12
|
Longest path; Prim's algorithm v.s.
Dijkstra's algorithm
|
|
|
|
13
|
Maximum flow
|
|
|
|