| Week of | Material Covered | Remarks |
| January 8 | Introduction to Theory of Computing | |
| January 15 | Mathematical review | |
| January 22 | Finite automata | |
| January 29 | Finite automata | |
| February 5 | Regular Expressions and Languages | |
| February 12 | Properties of Regular Languages | |
| February 14 | Midterm | |
| February 19 | Mid semester break | No Classes |
| February 26 | 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 |