Date	Topics	Readings
[Week 1] Aug 29	Introduction; Math preliminaries	Syllabus and course organization Chapter 1
Aug 31	Propositional Logic and Proofs (1) Practice exercises: 1.2, 1.3, 1.4, 1.5, 1.6, 2.1, 2.3 (a) and (b), 2.4, 2.7 (a), 2.16	Chapter 2: Sections 2.1, 2.2, 2.3, 2.4 Sample Quiz 1
[Week 2] Sept 5	Propositional Logic and Proofs (2)	Sections: 2.5, 3.1, 3.2, 3.3 Solutions of Sample Quiz 1
Sept 7	Quiz 1 Rules of inference; Assumptions Practice exercises: 2.5, 2.6, 2.7(b), 2.8, 2.11, 2.14, 2.15, 3.1	Sections: 3.4, 3.5, 3.6
[Week 3] Sept 12	More on Rules of inference; Exercises	Section 3.7 Sample Quiz 2 Solutions of Sample Quiz 2
Sept 14	Quiz 2 Predicate Logic and Quantifiers Practice exercises: 3.6, 3.10, 3.11, 4.1, 4.3, 4.4	Sections: 4.1, 4.2, 4.3
[Week 4] Sept 19	Proof Strategies with Predicates; Mathematical Induction	Sections: 4.4, 5.1, 5.2, 5.3, 5.4
Sept 21	Quiz 3 Mathematical Induction (1) Practice exercises: 5.2, 5.3, 5.4	Section 5.5 Sample Quiz 4 Solutions of Sample Quiz 4
[Week 5] Sept 26	Program verification (1)	Sections 6.1, 6.2, 6.3
Sept 28	Quiz 4 Program verification (2) Practice exercises: 6.2, 6.3, 6.4, 6.5, 6.6	Section 6.4
[Week 6] Oct 3	Prolog (1)	Sections A.1, A.2, (Appendix A) Practice exercises on Prolog: A1, A3 (ignore the use of semi-colon).
Oct 5	Midterm Review	Sample Midterm
[Week 7] Oct 10	NO CLASS
Oct 12	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 17	Prolog (3)	Sections A4, A5, A6, A7, A8
Oct 19	Solutions of Midterm Exam
[Week 9] Oct 24	Formal Languages Assignment 1	Chapter 7
Oct 26	Finite State Automata Practice exercises: 7.1, 7.4, 7.5, 7.6, 7.10, 7.12, 9.3, 9.4, 9.5 Quiz 5	Sections 9.1, 9.2, 9.3
[Week 10] Oct 31	More on Finite State Automata	Section 9.4
Nov 2	Quiz 6 Nondeterministic Finite Automata Practice exercises: 9.2, 9.6, 9.7, 9.8, 9.10, 9.11, 9.12, 9.13, 9.17, 9.18	Section 9.5
[Week 11] Nov 7	Lambda-transitions Assignment 1 due!
Nov 9	Quiz 7 Regular Languages Practice exercises: 8.1, 9.9, 9.10	Section 9.6
[Week 12] Nov 14	Regular Expressions	Section 8.1, 8.2, 8.3, 8.4
Nov 16	Quiz 8 Regular grammars	Sections 8.6, 8.7
[Week 13] Nov 21	Regular expressions Practice exercises: 8.2, 8.3, 8.4, 8.6, 8.7, 8.11 (build the FSA instead of the grammar) Assignment 2 Not available yet!
Nov 23 Thanksgiving!	NO CLASS
[Week 14] Nov 28	Context-free grammars Assignment 2 URLLexer.java Practice exercises: 10.1, 10.2, 10.3, 10.7	Sections 10.2, 10.3
Nov 30	Pushdown Automata Quiz 10	Sections 11.1, 11.2
[Week 15] Dec 5	Turing Machines; The Halting Problem.	Section 12.2
Dec 7	Review
Dec 14: 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.