|
|
|
|
|
| Lecture | Date | Topics | Reading
| Optional reading
|
|---|
| 1 | 3/28 | introduction, propositional logic | 1.1
| | 2 | 3/30 | logical equivalences | 1.2
| | 3 | 4/1 | predicates and quantifiers | 1.3-1.4
| | 4 | 4/4 | inference | 1.5
| | 5 | 4/6 | proofs | 1.6
| | 6 | 4/8 | more proofs | 1.7
| | 7 | 4/11 | sets | 2.1
| | 8 | 4/13 | operations on sets | 2.2
| | 9 | 4/15 | functions | 2.3
| | 10 | 4/18 | intro to number theory | 3.4
| ROT13
| | 11 | 4/20 | primes, efficiency | 3.5
| primeshooter,
survey on
primes
| | 12 | 4/22 | GCD | 3.5
| LCM in cicadas
| | 13 | 4/25 | Euclid's algorithm | 3.6
| | 14 | 4/27 | solving congruence equations | 3.6
| | 15 | 4/29 | RSA | 3.7
| Fermat's little theorem
| | 16 | 5/2 | midterm
| | 17 | 5/4 | induction | 4.1
| | 18 | 5/6 | applications of induction | 4.1
| Appendix 1 for the well-ordering axiom
| | 19 | 5/9 | strong induction | 4.2
| buffalo
| | 20 | 5/11 | recursion | 4.3-4.4
| | 21 | 5/13 | relations | 8.1
| | 22 | 5/16 |
equivalence relations and orderings | 8.5,8.6
| | 23 | 5/18 | graphs | 9.1
| | 24 | 5/20 | trees | 10.1
| lecture notes
| | 25 | 5/23 | boolean algebra and circuits | 11.1-11.3
| | 26 | 5/25 | finite state automata | 12.2-12.3
| | 27 | 5/27 | regular sets | 12.4
| | 28 | 6/1 | Turing machines and limits to computation | 12.5, 3.1
| | 29 | 6/3 | review
|
Readings are from Rosen, unless otherwise specified.
|
CSE Home 
