Problem Sets | 30% |
2 Exams | 35% each |
Class Participation | Tiebreaker |
Dates | Topic | Readings |
Jan 25, 27 | Introduction to Theory | Ch 1 |
Feb 1, 3 | Finite Automata | Ch 2 |
Feb 8, 10 | Finite Automata | Ch 2 |
Feb 15, 17 | Context-Free Languages | Ch 3 |
Feb 22, 24 | Context-Free Languages | Ch 3 |
Mar 1, 3 | Context-Free Languages | Ch 3 |
Mar 8 | Review for Exam 1 | Chs 1-3 |
Mar 8-11 | Take-Home Exam 1 | Chs 1-3 |
Mar 29, 31 | Turing Machines | Ch 4 |
Apr 5, 7 | Turing Machines | Ch 4 |
Apr 12, 14 | Undecidability | Ch 5 |
Apr 19, 21 | Undecidability | Ch 5 |
Apr 26, 28 | Complexity (NP-Completeness) | Ch 6 |
May 3, 5 | Complexity (NP-Completeness) | Ch 6 |
May 10 | Review for Exam 2 | Chs 4-6 |
Exam Period | Take-Home Exam 2 | Chs 4-6 |