Date	Topics	Readings
[Week 1] Jan 20	Introduction; Math preliminaries Practice exercises: 1.1, 1.2, 1.3, 1.4, 1.5, 1.6	Syllabus and course organization Chapter 1
[Week 2] Jan 25	Class canceled due to the weather
Jan 27	Quiz 1 Propositional Logic and Proofs (1) Practice exercises: 2.1, 2.2(a), 2.2(b), 2.3 (a) and (b), 2.4	Chapter 2: Sections 2.1, 2.2, 2.3, 2.4 Sample Quiz 2 (only Problem 1)
[Week 3] Feb 1	Propositional Logic and Proofs (2) Rules of inference	Sections: 2.5, 3.1, 3.2, 3.3, 3.4
Feb 3	Quiz 2 More on Rules of inference; Assumptions Practice exercises: 2.11, 3.5, 3.6, 3.7, 3.8, 3.9, 3.10	Sections 3.5, 3.6, 3.7
[Week 4] Feb 8	Predicate Logic	Sections: 4.1, 4.2, 4.3, 4.4
Feb 10	Quiz 3 Proof Strategies with Predicates; Mathematical Induction Practice exercises: 4.1, 4.4, 4.6, 4.8	Sections: 5.1, 5.2, 5.3, 5.4
[Week 5] Feb 15	Class canceled due to the weather
Feb 17	Quiz 4 Mathematical Induction (1) Discussion of Quiz 3 Practice exercises: 5.2, 5.3, 5.4	Section 5.5
[Week 6] Feb 22	Program verification	Sections 6.1, 6.2, 6.3
Feb 24	Quiz 5 Program verification (1) Problem solving Practice exercises: 6.2, 6.3, 6.4, 6.5, 6.6	Section 6.4
[Week 7] Feb 29	Prolog	Sections A1, A2, A3, A4, A5, A6 (Appendix A)
Mar 2	Quiz: be ready for a quiz on program verification! Midterm Review	Sample Midterm (ignore question 1(e))
[Week 8] Mar 7	SPRING BREAK!
Mar 9	SPRING BREAK!
[Week 9] Mar 14	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.	Chapter 7
Mar 16	Prolog: cut operator and lists	Sections A.7 and A.8
[Week 10] Mar 21	Assignment 1 Formal Languages	Sections 7.1, 7.2, 7.3, 7.4, 7.5
Mar 23	Quiz 6 (Prolog) Deterministic Finite State Automata	Sections 8.1, 8.2 Practice exercises: 7.1 through 7.6, 8.1, 8.2, 8.4, 8.5, 8.8
[Week 11] Mar 28	Solutions of Midterm Exam
Mar 30	Quiz 7 NFA	Sections 8.3, 9.1, 9.2
[Week 12] Apr 4	Assignment 1 Due! NFA; Subset construction	Section 8.4
Apr 6	Quiz 8 Lambda-transitions; Lambda elimination	Practice exercises: 9.2, 9.3
[Week 13] Apr 11	Regular Languages
Apr 13	Quiz 9 Regular expressions Practice exercises: 9.4, 9.5, 9.6, 9.7, 9.11, 9.12, 9.14, 9.15, 9.17	Sections 9.3, 9.4, 9.5
[Week 14] Apr 18	Assignment 2 out (sent by email) Regular languages and Regular expressions; Limitations of regular languages	Sections 8.5, 8.6
Apr 20	Quiz 10 Context-free grammars	Sections 10.1, 10.2, 10.3
[Week 15] Apr 25	Context-free grammars (2) Practice exercises: 10.1, 10.2, 10.3, 10.8	Sections 11.1, 11.2
Apr 27	Pushdown Automata	Section 12.2
[Week 16] May 2	Turing Machines
May 4	Make-up class: Review
May 9: 12PM-2PM	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.