Date | Topics | Readings |
---|---|---|
[Week 1] Aug 28 | Introduction; Math preliminaries |
Syllabus and course organization Chapter 1 |
Aug 30 | 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 4 | Propositional Logic and Proofs (2) | Sections: 2.5, 3.1, 3.2, 3.3 Solutions of Sample Quiz 1 |
Sept 6 | 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 11 | More on Rules of inference; Exercises |
Section 3.7 Sample Quiz 2 Solutions of Sample Quiz 2 |
Sept 13 | 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 18 | Proof Strategies with Predicates; Mathematical Induction |
Sections: 4.4, 5.1, 5.2, 5.3, 5.4 |
Sept 20 | 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 25 | Program verification (1) |
Sections 6.1, 6.2, 6.3 |
Sept 27 | Quiz 4 Program verification (2) Practice exercises: 6.2, 6.3, 6.4, 6.5, 6.6 |
Section 6.4 |
[Week 6] Oct 2 | Prolog (1) |
Sections A.1, A.2, (Appendix A) Practice exercises on Prolog: A1, A3 (ignore the use of semi-colon). |
Oct 4 | Midterm Review |
Sample Midterm |
[Week 7] Oct 9 | NO CLASS | |
Oct 11 | 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 16 |
Prolog (2) |
Sections A4, A5, A6, A7, A8 |
Oct 18 |
Quiz 5 Prolog (3) |
|
[Week 9] Oct 23 |
Formal Languages Assignment 1 |
Chapter 7 |
Oct 25 |
Finite State Automata Practice exercises: 7.1, 7.4, 7.5, 7.6, 7.10, 7.12, 9.3, 9.4, 9.5 Quiz 6 |
Sections 9.1, 9.2, 9.3 |
[Week 10] Oct 30 |
More on Finite State Automata |
Section 9.4 |
Nov 1 |
Quiz 7 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 6 |
Lambda-transitions Assignment 1 due! |
|
Nov 8 |
Quiz 8 Regular Languages Practice exercises: 8.1, 9.9, 9.10 |
Section 9.6 |
[Week 12] Nov 13 |
Regular Expressions |
Section 8.1, 8.2, 8.3, 8.4 |
Nov 15 |
Quiz 9 Regular grammars |
Sections 8.6, 8.7 |
[Week 13] Nov 20 | 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 URLLexer.java |
|
Nov 22 Thanksgiving! |
NO CLASS |
|
[Week 14] Nov 27 |
Context-free grammars Practice exercises: 10.1, 10.2, 10.3, 10.7 |
Sections 10.2, 10.3 |
Nov 29 |
Pushdown Automata Quiz 10 |
Sections 11.1, 11.2 |
[Week 15] Dec 4 |
Turing Machines; The Halting Problem. |
Section 12.2 |
Dec 6 | Review | |
Dec 13: 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. |