Lecture |
Date |
Topic |
Reading |
PPT Slides |
PDF Slides |
Inked Slides |
Lecture 1 | Mon, April 1 | Logic |
1.1, 1.2 (7th) 1.1 (6th) |
PPT |
PDF |
HTML |
Lecture 2 | Wed, April 3 | Logic |
1.1-1.3 (7th) 1.1-1.2 (6th) |
PPT |
PDF |
HTML |
Lecture 3 | Fri, April 5 | Logic/Boolean Algebra |
12.1-12.3 (7th) 11.1-11.3 (6th) |
PPT |
PDF |
HTML |
Lecture 4 | Mon, April 8 | Boolean Algebra/Circuits |
12.1-12.3 (7th) 11.1-11.3 (6th) |
PPT |
PDF |
HTML |
Lecture 5 | Wed, April 10 | Predicate Logic |
1.4-1.5 (7th) 1.3-1.4 (6th) |
PPT |
PDF |
HTML |
Lecture 6 | Fri, April 12 | Predicate Logic, Inference |
1.6-1.7 (7th) 1.5-1.7 (6th) |
PPT |
PDF |
No ink today |
Lecture 7 | Mon, April 15 | Logical Inference and Proofs |
1.6-1.7 (7th) 1.5-1.7 (6th) |
PPT |
PDF |
HTML |
Lecture 8 | Wed, April 17 | Proofs and Set Theory |
2.1-2.3 (6th,7th) |
PPT |
PDF |
HTML |
Lecture 9 | Fri, April 19 | Set Theory and Functions |
2.1-2.3 (6th, 7th) |
PPT |
PDF |
HTML |
Lecture 10 | Mon, April 22 | Modular Arithmetic |
4.1-4.2 (7th) 3.4-3.5 (6th) |
PPT |
PDF |
HTML |
Lecture 11 | Wed, April 24 | Applications of Mod, Number Theory |
4.1-4.3 (7th) 3.4-3.6 (6th) |
PPT |
PDF |
HTML |
Lecture 12 | Fri, April 26 | Factoring, GCD, Euclid's Algorithm |
4.3-4.4 (7th), 3.5-3.7 (6th) |
PPT |
PDF |
HTML |
Lecture 13 | Mon, April 29 | Induction |
5.1 (7th), 4.1 (6th) |
PPT |
PDF |
HTML |
Lecture 14 | Wed, May 1 | Induction and Strong Induction |
5.1-5.2 (7th), 4.1-4.2 (6th) |
PPT |
PDF |
HTML |
Lecture 15 | Fri, May 3 | Strong Induction and Recursion |
5.2-5.3 (7th), 4.2-4.3 (6th) |
PPT |
PDF |
HTML |
Lecture 16 | Mon, May 6 | Recursively Defined Sets |
5.3 (7th), 4.3 (6th) |
PPT |
PDF |
HTML |
Lecture 17 | Wed, May 8 | More Structural Induction |
5.3 (7th), 4.3 (6th) |
PPT |
PDF |
HTML |
Midterm | Fri, May 10 | Midterm |
Midterm |
Midterm |
Midterm |
Midterm |
Lecture 18 | Mon, May 13 | Regular Expressions |
pp.878-880 (7th) pp. 817-819 (6th) |
PPT |
PDF |
HTML |
Lecture 19 | Wed, May 15 | Context-Free Grammars |
pp. 851-855 (7th) pp. 789-793 (6th) |
PPT |
PDF |
HTML |
Lecture 20 | Fri, May 17 | Relations, Directed Graphs |
9.1, pp. 594-601 (7th)
8.1, pp. 541-548 (6th)
|
PPT |
PDF |
HTML |
Lecture 21 | Mon, May 20 | Finite State Machines |
13.3 (7th), 12.3 |
PPT |
PDF |
HTML |
Lecture 22 | Wed, May 22 | FSMs with Output, Minimization |
13.3-13.4 (7th), 12.3-12.4 (6th) |
PPT |
PDF |
HTML |
Lecture 23 | Fri, May 24 | NFAs,RegExp, NFAs to DFAs |
13.3-13.4 (7th), 12.3-12.4 (6th) |
PPT |
PDF |
HTML |
Holiday | Mon, May 27 | Memorial Day |
Holiday |
Holiday |
Holiday |
Holiday |
Lecture 24 | Wed, May 29 | Limits of FSMs, FSMs and Circuits |
13.4 (7th), 12.4 (6th) |
PPT |
PDF |
HTML |
Lecture 25 | Fri, May 31 | Pattern Matching, Cardinality |
2.5 + p. 201 (7th) p, 158-160, 177 (6th) |
PPT |
PDF |
No Ink |
Lecture 26 | Mon, June 3 | Turing Machines, Halting Problem |
p.201 + 13.5 (7th) p.177 + 12.5 (6th) |
PPT |
PDF |
No Ink |
Lecture 27 | Wed, June 5 | Undecidability |
p.201 + 13.5 (7th) p.177 + 12.5 (6th) |
PPT |
PDF |
HTML |
Lecture 28 | Fri, June 7 | Computability Wrap-up, Course Summary |
p.201 + 13.5 (7th) p.177 + 12.5 (6th) |
PPT |
PDF |
HTML |
Lecture RSA | Extra fun | RSA and Public Key Encryption |
p. 299-303 (7th) p. 241-244 (6th) |
PPT |
PDF |
No ink |