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