| Week of | Material Covered | Remarks |
| September 3 | Introduction to Theory of Computing | |
| September 10 | Mathematical review | |
| September 17 | Finite automata | |
| September 24 | Finite automata | |
| October 1 | Regular Expressions and Languages | |
| October 8 | Properties of Regular Languages | |
| October 15 | Midterm | |
| October 22 | Context Free Grammar and Languages | |
| October 29 | Pushdown Automata | |
| November 5 | Properties of Context-Free Languages | |
| November 12 | Introduction to Turing Machines. November 13 Student Development Day |
No classes |
| November 19 | Undecidability and Intractable Problems | |
| November 26 | Review |