Below is the tentative schedule of topics. We may cover topics earlier or later than listed depending upon the pace of the course. Homework assignments are generally assigned on Friday and due 1 week later. Written assignments are due in class. Programming assignments are due by 11:59pm to Canvas.
[Week 1] Introduction, Stable Matching problem, Running Time
|
[Week 2] Asymptotic Growth
Reading: 2.1-2.4 (2.3 is optional)
Code: None
HW Assigned: HW2 due Friday 9/20 in-class
|
[Week 3] Priority Queues and Graphs
|
[Week 4] Graphs and Greedy Algorithms
- Reading: 3.1-3.3, 3.6, 4.1, 4.4, 4.5, 4.8
- Code: None
- HW Assigned: None
- Prof. Chambers gone from Wednesday to Friday
|
[Week 5] Graphs and Greedy Algorithms
|
[Week 6] Greedy Algorithms
- Dates: 10/7-10/11
- Reading: 4.1, 4.4, 4.5, 4.8
- Code: None
- HW Assigned: HW5 to be due 10/18 in-class
|
[Week 7] Greedy Algorithms and Divide and Conquer
- Dates: 10/14-10/18
- Reading: 4.1, 4.4, 4.5, 4.8, 5.1-5.3
- Code: Stock Market Problem
- HW Assigned: Midterm study guide
|
[Week 8] Divide and Conquer
- Dates: 10/21-10/25
- Reading: 5.1-5.3
- Code: Stock Market Problem
- HW Assigned: None
- Midterm exam on Friday 10/25
|
[Week 9] Divide and Conquer
|
[Week 10] Dynamic Programming
|
[Week 11] Dynamic Programming
- Dates: 11/11 - 11/15
- Reading: 6.1, 6.2, 6.4, 6.6, 6.8
- Code: Dynamic Programming
- HW Assigned:HW7 to be due Wednesday 11/20 in class
|
|
[Week 12] Balanced Trees
|
|
[Week 13] Balanced Trees
|
[Week 14] NP-Completeness
- Dates: 12/2 - 12/6
- Reading: 8.1-8.4
- Code: None
- HW Assigned: --
|
[Week 15] NP-Completeness
- Dates: 12/9-12/13
- Reading: 8.1-8.4
- Code: None
- HW Assigned: HW9 due with your final (Extra Credit)
- Last day of classes is Wednesday
|
