Lecture | Date | Topic | Reading | PPT Slides | PDF Slides | Inked Slides (Lecture A) |
Inked Slides (Lecture B) |
Lecture 1 | Mon, Sept 24 | Logic | 1.1, 1.2 (7th) | PPT | |||
Lecture 2 | Wed, Sept 26 | Logic | 1.2, 1.3 (7th) | PPT | |||
Lecture 3 | Fri, Sept 28 | Logic | 1.3, 1.4 (7th) | PPT | |||
Lecture 4 | Mon, Oct 1 | Boolean Algebra and Circuits | 12.1-12.3 (7th) | PPT | |||
Lecture 5 | Wed, Oct 3 | Boolean Algebra and Circuits | 12.1-12.3 (7th) | PPT | |||
Lecture 6 | Fri, Oct 5 | Predicates | 1.4 (7th) | PPT | |||
Lecture 7 | Mon, Oct 8 | Predicates and Quantifiers | 1.6, 1.7 (7th) | PPT | HTML | HTML | |
Lecture 8 | Wed, Oct 10 | Logical Inference | 1.6, 1.7 (7th) | PPT | HTML | HTML | |
Lecture 9 | Fri, Oct 12 | Proofs | 2.1,2.2,2.3 (7th) | PPT | HTML | HTML | |
Lecture 10 | Mon, Oct 15 | Set theory | 2.1,2.2,2.3 (7th) | PPT | HTML | HTML | |
Lecture 11 | Wed, Oct 17 | Modular Arithmetic | 4.1, 4.2 (7th) | PPT | HTML | HTML | Lecture 12 | Fri, Oct 19 | Modular Arithmetic | 4.1, 4.2, 4.3 (7th) | PPT | HTML | HTML |
Lecture 13 | Mon, Oct 22 | Number theory | 4.1, 4.2, 4.3 (7th) | PPT | HTML | HTML | |
Lecture 14 | Wed, Oct 24 | GCD, Modular Inverse | 4.3, 5.1 (7th) | PPT | HTML | HTML | |
Lecture 15 | Fri, Oct 26 | Induction | 5.1 (7th) | PPT | HTML | HTML | |
Lecture 16 | Mon, Oct 29 | Strong induction | 5.2 (7th) | PPT | HTML | HTML | |
Lecture 17 | Wed, Oct 31 | Recursive Definitions | 5.3 (7th) | PPT | HTML | HTML | |
Lecture 18 | Mon, Nov 5 | Structural Induction | 5.3 (7th) | PPT | HTML | HTML | |
Lecture 19 | Wed, Nov 7 | Regular Expressions | pp. 878-880 and pp. 851-855 (7th) | PPT | HTML | HTML | |
Lecture 20 | Fri, Nov 9 | Context Free Languages | pp. 878-880 and pp. 851-855 (7th) | PPT | HTML | HTML | |
Lecture 21 | Wed, Nov 14 | Relations | Section 9.1 and pp. 594-601 (7th) | PPT | HTML | HTML | |
Lecture 22 | Fri, Nov 16 | Databases | Section 9.3 and 13.3(7th) | PPT | HTML | ||
Lecture 23 | Mon, Nov 19 | Finite State Machines | Section 13.3 and 13.4(7th) | PPT | HTML | HTML | |
Lecture 24 | Wed, Nov 21 | Finite State Machines | Section 13.3 and 13.4(7th) | PPT | HTML | ||
Lecture 25 | Mon, Nov 26 | Finite State Machine Minimization | Section 13.3 and 13.4(7th) | PPT | HTML | HTML | |
Lecture 26 | Wed, Nov 28 | DFAs, NFAs, and Regular Expressions | Section 13.3 and 13.4(7th) | PPT | HTML | HTML | |
Lecture 27 | Fri, Nov 30 | Limits of NFAs, Pattern matching | Section 13.4(7th) | PPT | HTML | HTML | |
Lecture 28 | Mon, Dec 2 | Cardinality | Section 2.5 (7th) | PPT | HTML | HTML | |
Lecture 29 | Wed, Dec 4 | Computability | 13.5(7th) | PPT | HTML | HTML | |
Lecture 30 | Fri, Dec 6 | Undecidability | p. 201 (7th) | PPT | HTML | HTML |