|
Date |
Topic |
|
Mon
|
March 31
|
Introduction and basic analysis
|
|
Wed
|
April 2
|
Divide-and-conquer
|
|
Fri
|
April 4
|
Divide-and-conquer
|
|
Mon
|
April 7
|
Lower bound analysis
|
|
Wed
|
April 9
|
Greedy
|
|
Fri
|
April 11
|
(no class)
|
|
Mon
|
April 14
|
Greedy
|
|
Wed
|
April 16
|
Greedy
|
|
Fri
|
April 18
|
Data structure: trees
|
|
Mon
|
April 21
|
Data structure: trees
|
|
Wed
|
April 23
|
DP
|
|
Fri
|
April 25
|
(no class)
|
|
Mon
|
April 28
|
DP
|
|
Wed
|
April 30
|
DP
|
|
Fri
|
May 2
|
DP
|
|
Mon
|
May 5
|
DP
|
|
Wed
|
May 7
|
Randomized algorithms
|
|
Fri
|
May 9
|
(Prepare for midterm exam)
|
|
Mon
|
May 12
|
Midterm exam
|
|
Wed
|
May 14
|
Amortized analysis
|
|
Fri
|
May 16
|
(no class)
|
|
Mon
|
May 19
|
Graph
|
|
Wed
|
May 21
|
Graph and data structure
|
|
Fri
|
May 23
|
Graph
|
|
Mon
|
May 26
|
(Holiday)
|
|
Wed
|
May 28
|
Graph
|
|
Fri
|
May 30
|
Graph
|
|
Mon
|
June 2
|
Selected Topics for Modern Algorithm Research
|
|
Wed
|
June 4
|
Selected Topics for Modern Algorithm Research
|
|
Fri
|
June 6
|
(Prepare for final exam)
|
|
Mon
|
June 9
|
Final Exam (11:30 a.m. - 2:30 p.m.)
|
