![[Bowdoin Computer Science]](bowdoin-cs-logo.small.jpg)
Tentative Schedule
1/23:
1/28, 1/30:
2/4, 2/6, 2/11, 2/13:
2/18, 2/20, 2/25, 2/27:
- Topics: Pushdown Automata (PDA)
- Reading: Chs 11-13
3/4:
- Topics: FSA and PDA Applications
- Reading: Appendices
Exam 1: Wednesday, 3/6 (in-class): covers everything through PDAs
3/25, 3/27, 4/1, 4/3:
- Topics: Turing Machines
- Reading: Chs 17-19
4/8, 4/10, 4/15, 4/17:
- Topics: Undecidability
- Reading: Chs 20, 21
4/22, 4/24, 4/29, 5/1, 5/6, 5/8:
- Topics: Complexity (NP-Completeness)
- Reading: Chs 27, 28
Exam 2: Wednesday, May 15, 8:30 - 11:30 pm: covers everything from Turing Machines on