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