Frequency of Offering: This course is offered as an elective on an as-needed basis.
| Topic | Relates to Book |
| Math and Strings | 0.1, 0.2 |
| Proofs | 0.3, 0.4 |
| DFAs, NFAs | 1.1, 1.2 |
| Regular Expressions and Languages | 1.3, 1.4 |
| Context-Free Grammars and Languages | 2.1 |
| Pushdown Automata | 2.2 |
| Turing Machines | 3.1 |
| Decidable and Countable | 3.2, 3.3, 4.1, 4.2 |
| Undecidable | 5.1, 5.2 |
| Computability | 6.1, 6.4 |
| Time Complexity and P | 7.1-7.2 |
| NP-Completeness | 7.3 |
| NP-Complete Problems | 7.4-7.5 |
| NP-Complete Landscape | 7 |
| Complexity | 8,10 |
| Quiz | Relates to Book |
| quiz 1 |
0.2 |
| quiz 2 | 0.2 - 0.4 |
| quiz 3 | 1.1, 1.2 |
| Test 1 (due TBD) | chapters 0, 1 |
| quiz 4 | 2.1 |
| quiz 5 | 2.2 |
| quiz 6 | 3.1 |
| Test 2 (due TBD) | chapters 1-3 |
| quiz 7 | 4 |
| quiz 8 | 4, 5 |
| Test 3 (due TBD) | chapters 4-7 |
1Some of these notes (and quizzes) use a math font that really only works with IE browser.
2A quiz is not turned in for a grade. A quiz was graded in days past and the name just hasn't changed. It should be interpreted as "practice problems".