| Week of | Material Covered | Remarks |
| January 3 | No Class | |
| January 7 | Introduction to Theory of Computing | |
| January 14 | Mathematical review | |
| January 21 | Finite automata | |
| January 28 | Finite automata | |
| February 4 | Regular Expressions and Languages | |
| February 11 | Properties of Regular Languages | |
| February 13 | Midterm | |
| February 18 | Mid semester break | No Classes |
| February 25 | Context Free Grammar and Languages | |
| March 4 | Pushdown Automata | |
| March 11 | Properties of Context-Free Languages | |
| March 18 | Introduction to Turing Machines | |
| March 25 | Undecidability and Intractable Problems | |
| April 1 | Review |