| Number | Assignment | Due (Section 02) |
|---|---|---|
| 0 | Homework Administration | Monday 14 January 2013 at 11:00pm. |
| 1 | Sorting and Recurrences | Monday 21 January 2013 at 11:00pm. |
| 2 | Graph Search Algorithms | Monday 28 January 2013 at 11:00pm. |
| 3 | Graph Decomposition | Monday 4 February 2013 at 11:00pm. |
| 4 | Shortest Path Algorithms | Monday 11 February 2013 at 11:00pm. |
| 5 | Greedy Algorithms | Monday 25 February 2013 at 11:00pm. |
| 6 | Dynamic Programming | Monday 11 March 2013 at 11:00pm. |
| 7 | Linear Programming | Monday 18 March 2013 at 11:00pm. |
| 8 | Network Flows and the Simplex Method | Monday 25 March 2013 at 11:00pm. |
| 9 | Monte Carlo Methods | Monday 1 April 2013 at 11:00pm. |
| 10 | NP-Completeness | Thursday 11 April 2013 at 11:00pm. |
The due date for Section 03 is on day later in every case except for Assignment #10. For Assignment #10, the due date is the same for both sections.