| |
| Topic |
Class dates |
Notes/Handouts, Videos |
Reading assignments |
| Introduction |
1 (9/1) |
slides(ppt,pdf) |
Chapter 1 |
| Logic: proposition and arguments |
2 (9/9, 9/13) |
slides(ppt,pdf) |
Chapter 2, homework 1 due 9/16
|
| Logic: quantified statements |
2 (9/16, 9/20, 9/23) |
slides(ppt,pdf) |
3.1-3.4, homework 2 due 9/23, Friday |
| Proof: direct proof, counter example, contradiction, countraposition |
4 (9/27, 9/30, 10/4, 10/7) |
slides .4.1-4.5 (ppt,pdf)
slides 4.6(ppt,pdf)
slides 4.7(ppt,pdf)
slides 4.8(ppt,pdf)
|
Chapter 4, homework 3 due 10/7 |
| Midterm |
Review for midterm 10/11, Midterm Exam 10/14 |
|
| Math Induction, Recursion, Recurrence relation |
3 |
|
Chapter 5, homework 4 due 10/26, Wednesday |
| Function: hashing |
3 |
Lab Class #1,
Lab Class #2 |
Chapter 7,
Lab2 due 11/6, Sunday |
| Relation: modular arithmetic and RSA |
11/11, 11/15, 11/18 |
Why RSA works? |
Chapter 8, lab3 |
| Graphs and Trees |
3 |
slides (ppt,
pdf),
proof of gcd |
Chapter 9,
homework on graph
|
| Review and Final (Wednesday, 12/14, 1:30pm) |
|
|
|
