Date	Topics	Readings
[Week 1] Jan 22	Introduction; Math preliminaries Homework 1	Syllabus and course organization Chapter 1
[Week 2] Jan 27	Propositional Logic and Proofs (1)	Chapter 2: Sections 2.1, 2.2, 2.3, 2.4 Sample Quiz 1 [Ignore problem 3 for now. Quiz 1 on Jan. 29 will NOT cover propositional logic.]
Jan 29	Propositional Logic and Proofs (2) Quiz 1 Homework 2	Sections: 2.5, 3.1, 3.2, 3.3 Solutions of Sample Quiz 1
[Week 3] Feb 3	Rules of inference; Assumptions	Sections: 3.4, 3.5, 3.6
Feb 5	More on Rules of inference; Exercises Quiz 2 Homework 3	Section 3.7 Sample Quiz 2 Solutions of Sample Quiz 2
[Week 4] Feb 10	Predicate Logic	Sections: 4.1, 4.2
Feb 12	Quantifiers; Proof Strategies with Predicates Quiz 3 Homework 4	Sections: 4.3, 4.4, 5.1, 5.2
[Week 5] Feb 17	Problem solving
Feb 19	Mathematical Induction; Exercises Quiz 4 Homework 5	Sections 5.3, 5.4, 5.5
[Week 6] Feb 24	Program verification (1)	Section 6.1, 6.2, 6.3
Feb 26	Program verification (2) Quiz 5 Homework 6
[Week 7] Mar 2	Loop invariants: problem solving.	Sample Midterm
Mar 4	Midterm Review
[Week 8] Mar 9	Spring Recess: no class
Mar 11	Spring Recess: no class
Mar 16	Extended Spring Recess: no class
Mar 18	Extended Spring Recess: no class
[Week 9] Mar 23	Formal Languages	Chapter 7
Mar 25	Finite State Automata
[Week 10] Mar 30	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 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.
Apr 1	Finite State Automata Homework 7	Sections 9.1, 9.2
[Week 11] Apr 6	More on Finite State Automata	Section 9.3
Apr 8	Nondeterministic Finite Automata Quiz 6 Homework 8	Section 9.5
[Week 12] Apr 13	NFAs and DFAs: subset construction	Handout (posted on Piazza)
Apr 15	Lambda-transitions and Lambda-NFAs Quiz 7 Homework 9 out	Handout (posted on Piazza)
[Week 13] Apr 20	Regular languages and their closure properties	Section 9.6, 8.1, 8.2, 8.3, 8.4
Apr 22	Regular expressions Quiz 8 Homework 10 out	Handout (posted on Piazza)
[Week 14] Apr 27	Equivalence between Finite State Automata and Regular expressions	Handout (posted on Piazza)
Apr 29	Limitations of Regular Languages Quiz 9 Homework 11 out
[Week 15] May 4	Context-free grammars; Pushdown Automata	Sections 8.6, 8.7, 10.1, 10.2, 11.1, 11.2
May 6	Turing Machines; The Halting Problem. Quiz 10	Section 12.2
May 11	Review
May 18: 1:30PM - 4: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.