| Week of | Material Covered | Remarks |
| January 11 | Introduction to Theory of Computing | |
| January 18 | Mathematical review | |
| January 25 | Finite automata | |
| February 1 | Finite automata | |
| February 8 | Regular Expressions and Languages | |
| February 15 | Mid semester break | No Classes |
| February 22 | Properties of Regular Languages | Midterm |
| March 1 | Context Free Grammar and Languages | |
| March 8 | Pushdown Automata | |
| March 15 | Properties of Context-Free Languages | |
| March 22 | Introduction to Turing Machines | |
| March 29 | Undecidability and Intractable Problems | |
| April 5 | Review |