SA367 ⬝ Spring 2021 ⬝ Sections 3401 and 5601
Assoc. Prof. Nelson Uhan
5/17 |
The semester is over! |
|||||||||||||||
4/26 |
|
|||||||||||||||
4/14 |
Quiz 7 will take place on Tuesday 4/20.
|
|||||||||||||||
4/12 |
|
|||||||||||||||
4/6 |
|
|||||||||||||||
3/29 |
|
|||||||||||||||
3/25 |
|
|||||||||||||||
3/25 |
Plan for next week:
Exam 2 will take place on Thursday 4/1.
|
|||||||||||||||
3/22 |
Quiz 6 will take place on Thursday 3/25.
|
|||||||||||||||
3/15 |
No quiz this week! Consider working on a resubmission of Quiz 5. |
|||||||||||||||
3/9 |
Quiz 5 is a take-home quiz due at the beginning of class on Thursday 3/11.
|
|||||||||||||||
3/2 |
Quiz 4 will take place on Thursday 3/4.
|
|||||||||||||||
2/24 |
This is the last week for resubmissions to count for your 6-week marking period grade.
|
|||||||||||||||
2/10 (updated 2/17) |
Plan for the next two weeks:
Exam 1 will take place on Tuesday 2/23.
|
|||||||||||||||
2/8 |
Quiz 3 will take place on Thursday 2/11.
|
|||||||||||||||
2/1 |
Quiz 2 is a take-home quiz due at the beginning of class on Thursday 2/4.
|
|||||||||||||||
1/25 |
Quiz 1 will take place on Thursday 1/28.
|
|||||||||||||||
1/25 |
Quiz 0 is due on Tuesday 1/26 at 23:59.
|
|||||||||||||||
1/18 |
Welcome! |
Date | Class | Homework |
---|---|---|
5/4 |
|
|
4/29 |
|
|
4/27 |
|
|
4/22 |
|
|
4/20 |
|
|
4/15 |
|
|
4/13 |
|
|
4/8 |
|
|
4/6 |
|
|
4/1 |
|
|
3/30 |
|
|
3/25 |
|
|
3/23 |
|
|
3/18 |
|
|
3/16 |
|
|
3/11 |
|
|
3/9 |
|
|
3/4 |
|
|
3/2 |
|
|
2/25 |
|
|
2/23 |
|
|
2/18 |
|
|
2/16 |
|
|
2/11 |
|
|
2/9 |
|
|
2/4 |
|
|
2/2 |
|
|
1/28 |
|
|
1/26 |
|
|
1/21 |
|
|
Dates | Lesson | ||
---|---|---|---|
|
16 | Solving the points-after-touchdown problem | |
|
15 | Solving stochastic dynamic programs with Python | |
|
14 | The points-after-touchdown problem | |
|
13 | Introduction to stochastic dynamic programming | |
|
12 | Dynamic programming — review | |
|
11 | Formulating DP recursions | |
|
10 | The principle of optimality and formulating recursions | |
|
9 | Machine scheduling | |
|
8 | Drafting a fantasy basketball team | |
|
7 | Big DPs and the curse of dimensionality | |
|
6 | Solving dynamic programs with NetworkX | |
|
5 | Introduction to dynamic programming | |
|
4 | The mileage running problem | |
|
3 | Solving shortest path problems with NetworkX | |
|
2 | Introduction to Jupyter and Python | |
|
1 | Introduction and the shortest path problem |
Date | Quiz | |
---|---|---|
4/20 | Quiz 7 | |
3/25 | Quiz 6 | |
3/11 | Quiz 5 | |
3/4 | Quiz 4 | |
2/11 | Quiz 3 | |
2/4 | Quiz 2 | |
1/28 | Quiz 1 | |
1/26 | Quiz 0 |
Date | Exam | |
---|---|---|
4/1 | Exam 2 | |
2/23 | Exam 1 |