| Date | Description |
|---|---|
| January 10 | HW1: Shortest Paths (paper) due |
| January 21 | HW2: Binary Search (coding) due |
| January 24 | HW3: Divide & Conquer (paper) due |
| February 2 | HW4: Divide & Conquer (coding) due |
| February 7 | HW5: Dynamic Programming (paper) due |
| February 19 | HW6: Dynamic Programming (coding) due |
| February 23 | HW7: Network Flows (paper) due |
| March 2 | HW8: Network Flows (coding) due |
| March 9 | HW9: Branch & Bound (coding) due |