Schedule of Classes - A Term 2009

Week
| Date
| Due
| Topic
| Book Chapters/Sections
| |

1 | Th | Aug 27 | Mathematical Foundations and Languages | Chapters 1 & 2 | |

Fr | Aug 28 | ||||

2 | Mo | Aug 31 | Context Free Languages | Chapter 3 | |

Tu | Sep 01 | ||||

Th | Sep 03 | ||||

Fr | Sep 04 | ||||

3 | Tu | Sep 08 | Normal Forms for Context-Free Grammars | Sections 4.1-4.5,4.7-4.8 | |

Th | Sep 10 | ||||

Fr | Sep 11 | ||||

4 | Mo | Sep 14 | Finite Automata | Sections 5.1-5.6 | |

Tu | Sep 15 | HW1HW1 Solutions
| |||

Th | Sep 17 | ||||

Fr | Sep 18 | ||||

5 | Mo | Sep 21 | Regular Languages | Chapter 6 | |

Tu | Sep 22 | HW2HW2 Solutions
| |||

Th | Sep 24 | ||||

Fr | Sep 25 | ** EXAM 1 **Exam1 Solutions
| |||

6 | Mo | Sep 28 | Pushdown Automata and Context-Free Languages | Chapter 7 | |

Tu | Sep 29 | ||||

Th | Oct 01 | ||||

Fr | Oct 02 | HW3HW3 Solutions
| |||

7 | Mo | Oct 05 | Turing Machines and Decidability | Chapters 8 & 11 | |

Tu | Oct 06 | ||||

Th | Oct 08 | ||||

Fr | Oct 09 | HW4HW4 Solutions
| |||

8 | Mo | Oct 12 | P, NP, NP-completeness | Chapters 15 & 16 | |

Tu | Oct 13 | ** EXAM 2 ** Exam2 Solutions
| |||

Th | Oct 15 |