| CS581 home page | Syllabus | Schedule/Readings | Homework Assignments | Exams and Grading |
Note: Homeworks are due to the instructor at the beginning of class on the date specified, unless otherwise noted.
| Homework Number | Topic | Due Date |
| HW 1 | Asymptotic Notation and Recurrences | Thurs., 1/20 |
| HW 2 | Divide and Conquer | Thurs., 1/27 |
| HW 3 | Dynamic Programming I | Thurs., 2/03 |
| HW 4 | Dynamic Programming II | Thurs., 2/10 |
| HW 5 | Greedy Algorithms | Tues., 2/22 |
| HW 6 | SS-Shortest Paths and Maximum Flow | Thurs., 3/03 |
| HW 7 | NP-Completeness I | Thurs., 3/10 |
| HW 8 | NP-Completeness II | Thurs., 3/17 |
| HW 9 | NP-Completeness III | Thurs., 3/31 |
| HW 10 | Linear Programming | Thurs., 4/21 |
| HW 11 | Computational Geometry | Fri., 4/29 (During study period) Due 12:00 Noon to instructor's office |