| Schedule (approx) | Topic (relates to book) | Task (due date) |
| August | ||
| Math and Strings (0.1, 0.2) | Practice Set#1 | |
| Proofs (0.3, 0.4) | Practice Set#2 | |
| September | DFAs (1.1) , NFAs (1.2) | Practice Set#3 |
| Regular Expressions and Languages (1.3, 1.4) | Test#1 (Tue Sep 29) | |
| Context-Free Grammars and Languages (2.1) | Practice Set#4 | |
| October | Pushdown Automata (2.2) | Practice Set#5 |
| Turing Machines (3.1) | Practice Set#6, Test#2 (Tue Nov 10) | |
| Decidable and Countable (3.2, 3.3, 4.1, 4.2) | Practice Set#7 | |
| Undecidable (5.1, 5.2) | Practice Set#8 | |
| November | Computability (6.1, 6.4) | |
| Time Complexity and P (7.1, 7.2) | Test#3 (Tue Dec 1) | |
| NP-Completeness (7.3) | ||
| NP-Complete Problems (7.4, 7.5) | ||
| NP-Complete Landscape (7) | ||
| December | Complexity (8, 10) | round two for tests (noon Thur Dec 10) |