Date	Topics	Readings
[Week 1] Aug 24	Introduction; Math preliminaries	Chapter 1
Aug 26	Propositional Logic and Proofs (1) Homework 1 OUT	Chapter 2: Sections 2.1, 2.2, 2.3, 2.4
[Week 2] Aug 31	Propositional Logic and Proofs (2)	Sections: 2.5, 3.1, 3.2, 3.3
Sept 2	Quiz 1 Rules of inference; Assumptions Homework 2 OUT	Sections: 3.4, 3.5, 3.6
[Week 3] Sept 7	More on Rules of inference; Exercises	Section 3.7
Sept 9	Quiz 2 Predicate Logic Homework 3 OUT	Sections: 4.1, 4.2
[Week 4] Sept 14	Quantifiers; Proof Strategies with Predicates	Sections: 4.3, 4.4, 5.1, 5.2
Sept 16	Quiz 3 Mathematical Induction (1) Homework 4 OUT	Sections 5.3, 5.4
[Week 5] Sept 21	Mathematical Induction (2): Problem Solving	Section 5.5
Sept 23	Quiz 4 Program verification (1) Homework 5 OUT	Section 6.1, 6.2, 6.3
[Week 6] Sept 28	Program verification (2)
Sept 30	Loop invariants: problem solving. Quiz 5 Homework 6 OUT	Sample Midterm (posted on Blackboard)
[Week 7] Oct 5	Midterm Review
Oct 7	Midterm. The exam is closed book. Limited notes are permitted: one sheet of notes (8.5 x 11 inches, 1 side only). No copying is a llowed, i.e., no photocopying of anything and no copying of someone else' notes. The sheet must have the student's name on it and must be turned in with the exam.
[Week 8] Oct 12	NO CLASS: Fall Break
Oct 14	Formal Languages Homework 7 OUT	Chapter 7
[Week 9] Oct 19	Midterm's solutions
Oct 21	Quiz 6 Finite State Automata Homework 8 OUT	Sections 9.1, 9.2
[Week 10] Oct 26	More on Finite State Automata	Section 9.3
Oct 28	Quiz 7 Nondeterministic Finite Automata Homework 9 OUT	Section 9.5
[Week 11] Nov 2	NFAs and DFAs: subset construction	See handout posted on Piazza
Nov 4	Quiz 8 Lambda-transitions and Lambda-NFAs Homework 10 OUT	See handout posted on Piazza
[Week 12] Nov 9	Regular languages and their closure properties	Section 9.6, 8.1, 8.2, 8.3, 8.4
Nov 11	Quiz 9 Regular expressions Homework 11 OUT	See handout posted on Piazza
[Week 13] Nov 16	Equivalence between Finite State Automata and Regular expressions	See handout posted on Piazza
Nov 18	Quiz 10 Limitations of Regular Languages Homework 12 OUT
[Week 14] Nov 23	Context-free grammars; Pushdown Automata	Sections 8.6, 8.7, 10.1, 10.2, 11.1, 11.2
Nov 25 Thanksgiving!	NO CLASS
[Week 15] Nov 30	Turing Machines; The Halting Problem.	Section 12.2
Dec 2	Review
Dec 9: 10:30AM-1:15PM.	Final Exam. The exam is closed book. Limited notes are permitted: one sheet of notes (8.5 x 11 inches, 1 side only). No copying is allowed, i.e., no photocopying of anything and no copying of someone else' notes. The sheet must have the student's name on it and must be turned in with the exam.