Date	Topics	Readings
[Week 1] Sept 1	Introduction; Math preliminaries	Syllabus and course organization Chapter 1
Sept 3	Propositional Logic and Proofs (1) Practice exercises: 1.1, 1.2, 1.3, 1.4, 1.5, 1.6, 2.1	Chapter 2: Sections 2.1, 2.2, 2.3, 2.4 Sample Quiz 1
[Week 2] Sept 8	Propositional Logic and Proofs (2)	Sections: 2.5, 3.1, 3.2, 3.3 Solutions of Sample Quiz 1
Sept 10	Quiz 1 Rules of inference Practice exercises: 2.2(a), 2.2(b), 2.3, 2.9, 2.11, 3.5, 3.6, 3.7, 3.8, 3.9, 3.10	Sections: 3.4, 3.5 Sample Quiz 2 Solutions of Sample Quiz 2
[Week 3] Sept 15	More on Rules of inference; Assumptions	Sections 3.6
Sept 17	Quiz 2 Predicate Logic and Quantifiers Practice exercises: 4.1	Sections: 3.7, 4.1, 4.2, 4.3 Sample Quiz 3 Solutions of Sample Quiz 3
[Week 4] Sept 22	Proof Strategies with Predicates; Mathematical Induction	Sections: 4.4, 5.1, 5.2, 5.3, 5.4
Sept 24	Quiz 3 Mathematical Induction (1) Practice exercises: 5.2, 5.3, 5.4	Section 5.5 Sample Quiz 4 Another Sample Quiz 4 Solutions of Sample Quiz 4 Solutions of Another Sample Quiz 4
[Week 5] Sept 29	Program verification	Sections 6.1, 6.2, 6.3, 6.4
Oct 1	Quiz 4 Prolog (1) Practice exercises: 6.2, 6.3, 6.4, 6.5	Sections A.1, A.2 (Appendix A)
[Week 6] Oct 6	Prolog (2)	Sections A4, A5, A6
Oct 8	Midterm Review	Sample Midterm Sample Quiz 5 Solutions of Sample Quiz 5
[Week 7] Oct 13	NO CLASS
Oct 15	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 20	Prolog (3)	Sections A7, A8
Oct 22	Formal languages Quiz 5	Chapter 7
[Week 9] Oct 27	Assignment 1 Finite State Automata Practice exercises: 7.1 through 7.6	Sections 8.1, 8.2, 8.3
Oct 29	Solutions of Midterm exam Practice exercises: 8.1, 8.2, 8.4, 8.5, 8.8 Quiz 6
[Week 10] Nov 3	Nondeterministic Finite Automata
Nov 5	Quiz 7 Nondeterministic Finite Automata	Section 9.1,9.2
[Week 11] Nov 10	Prolog assignment due Lambda-transitions
Nov 12	Quiz 8 Regular Languages Practice exercises: 8.17, 8.18	Section 8.4
[Week 12] Nov 17	Regular Expressions	Section 9.3
Nov 19	Quiz 9 Regular Expressions	Sections 8.5, 9.4, 9.5, 9.6
[Week 13] Nov 24	Context-free grammars (1) Practice exercises: 9.2, 9.3, 9.4, 9.5, 9.6, 9.7, 9.11, 9.12, 9.14, 9.15, 9.17 Assignment 2 has been emailed! It's due on December 13 at midnight!	Sections 9.6, 10.1
Nov 26 Thanksgiving!	NO CLASS
[Week 14] Dec 1	Context-free grammars (2)	Sections 10.2, 10.3
Dec 3	Pushdown Automata Quiz 10	Sections 11.1, 11.2
[Week 15] Dec 8	Turing Machines; The Halting Problem.	Section 12.2
Dec 10	Review
Dec 17: 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.