CS350 - Theory of Computation

Chapter Lab Files Due Date
Feb 9 Chapter 2- SISO Model and Decision Problems Module0 lab0.zip Feb 16
Feb 11 Chapter 3 - Impossible Python Programs Module1 Feb 23
Feb 18 Chapter 4 - Problems and Languages Module2 Feb 25
Feb 25 Chapter 5 - Turing Machines Module3 Mar 9
Exam 1 Mar 4
Mar 9 Chapter 6 - Universal Programs Module4 lab4.zip Mar 11
Mar 11 Chapter 7 - Reductions Module5 Mar 18
Mar 18 Chapter 8 - Nondeterminism Module6 Mar 25
Mar 23 Chapter 9 - Finite Automata Module7 Apr 1
Apr 1 Chapter 9 (continued) - Regular Languages Properties Module8 Apr 13
Exam 2 Apr 6
Apr 13 Appendix - Context Free Grammars and Pushdown Automata Module9 Apr 20
Apr 20 Appendix - Properties of Context Free Languages Module10 Apr 27
Apr 27 Chapters 11,12 - P = NP? Module11 May 6
Exam 3 Apr 29
May 6 Chapters 13,14 - NP-Completeness Module12 Extra Credit - May 11
Final TBA