| CS580 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.
| Homework Number | Topic | Due Date | Solutions |
| HW 1 | DFAs, NFAs | Tues., 1/20 | HW-1 Solutions |
| HW 2 | Regular & non-regular languages | Tues., 1/27 | HW-2 Solutions |
| HW 3 | CFGs, PDAs | Tues., 2/3 | HW-3 Solutions |
| HW 4 | Turing Machines, Decidability | Tues., 2/10 | HW-4 Solutions |
| HW 5 | Asymptotic Analysis, Algorithms in P |
Thurs., 2/26 | HW-5 Solutions |
| HW 6 | Polynomial Time Reducibility, NP-Complete problems |
Thurs., 3/4 | HW-6 Solutions |
| HW 7 | More on P, NP, NP-complete and co-NP | Tues., 3/16 | HW-7 Solutions |
| HW 8 | PSPACE | Tues., 3/23 | HW-8 Solutions |
| HW 9 | Approximation Algorithms | Tues., 4/6 | HW-9 Solutions |
| HW 10 | More Approximation Algorithms | Tues., 4/13 | HW-10 Solutions |
| HW 11 | Dynamic Programming | Tues., 4/20 | HW-11 Solutions |
| HW 12 | Greedy Algorithms, Computational Geometry |
Tues., 4/27 | HW-12 Solutions |