Lect. 2. Stable matching problem: a motivating example
matching, basic algorithm design and analysis.
||Lect. 3. Asymptotic
Lect. 4. Common running time.
|HW2. Asymptotic notations. Running time analysis.|
||Lect. 5. Quiz.
Basic graph algorithms: BFS and DFS
Lect. 6. More DFS and its applications.
|HW3. Basic graph algorithms.|
||Lect. 7. Greedy
Lect. 8. Greedy algorithm (cont.).
||Lect. 9. Divide
Lect. 10. More on divide and conquer.
|HW5. Divide and conquer|
||Midterm exam 1.
Lect.11. Still more on divide and conquer: FFT.
Lect. 13. More on dynamic programming
|HW6. Dynamic programming|
Still more dynamic programming
Lect. 15. Even more dynamic programming
|HW7. Dynamic programming|
Lect. 17. Network flows (cont.)
|HW8. Network flows|
||Lect. 18 Concept of
Midterm exam 2.
Lect. 20. NP completeness: proofs.
NP completeness: proofs
Lect. 22. Cope with NP completeness: heuristics and speical instances.
|HW9. NP completeness.|
Lect. 24. More on approximation algorithms.
|HW10. Coping with NP completeness.|
Introduction to randomized algorithms.
Lect. 26. More on randomized algorithms.