| Date | Material | Comments and References |
|---|---|---|
| Jan. 7 | Administrative issues | Syllabus handed |
| Jan. 9 | Basic Logic | Chap. 1 |
| Jan. 11 | Basic Logic | Chap. 1; LECTURE NOTES |
| Jan. 14 | Basic Logic | Chap. 1 |
| Jan. 16 | Language of Mathematics: Sets | Chap. 1.8 |
| Jan. 18 | Language of Mathematics: Relationships | Chap. 7.1; Homework 1 due |
| Jan. 21 | Martin Luther King Day | no classes |
| Jan. 23 | Language of Mathematics: Sequences | Chap. 7.5 |
| Jan. 25 | Language of Mathematics: Sums and products. | Chap. 3.2; LECTURE NOTES |
| Jan 28 | Proof Technniques | Chap. 1.5 and 3.1 |
| Jan 30 | Proof Technniques | Chap. 3.1; LECTURE NOTES |
| . | ||
| Feb. 1 | Proof Technniques | Chap. 1.5 and lecture; Homework 2 due |
| Feb. 4 | Proof techniques | Chap. 1.5 |
| Feb. 6 | Mathematical Induction | Chap 3 |
| Feb. 8 | Mathematical Induction | Chap 3.3; Homework 3 due |
| Feb. 11 | Math Induction | Chap. 3.3 |
| Feb. 13 | Math Induction | Chap. 3.3; |
| Feb. 15 | Math Induction | Chap. 3.3 LECTURE NOTES |
| Feb. 18 | Algorithms | Chap. 3.5 ; Homework 4 due |
| Feb. 20 | Algorithms 3.5 | Lecture |
| Feb. 22 | MIDTERM | MIDTERM |
| Feb. 25 | Basic Number Theory | Chap 2.5 |
| Feb. 27 | Basic Number Theory | Chap. 2.5 |
| Feb. 29 | Basic Number Theory | Chap. 2.5 |
| . | ||
| Mar. 3 | Basic Number Theory | Chap. 2.6 |
| Mar. 5 | Applications -- Hashing | Chap. 2.6 LECTURE NOTES |
| Mar. 7 | Applications -- RSA | Chap. 2.6; Homework 5 due |
| Mar. 10 | SPRING BREAK | SPRING BREAK |
| Mar. 12 | SPRING BREAK | SPRING BREAK |
| Mar. 14 | SPRING BREAK | SPRING BREAK |
| Mar. 17 | Basic Counting | Chap. 4 |
| Mar. 19 | Basic Counting | Chap. 4 |
| Mar. 21 | Basic Counting | Lecture; Homework 6 due |
| Mar. 24 | Advanced Counting | Chap. 6, LECTURE NOTES |
| Mar. 26 | Discrete Probability | Chap. 5; |
| Mar. 28 | Discrete Probability | Chap. 5; Homework 7 due |
| Mar. 31 | Discrete Probability | LECTURE |
| . | ||
| Apr. 2 | Discrete Probability | Chap. 5 |
| Apr. 4 | Probability, Average-case analysis of algorithms | Homework 8 due |
| Apr. 7 | MIDTERM | MIDTERM |
| Apr. 9 | Discrete Probability | Chap. 5; LECTURE |
| Apr. 11 | Discrete Probability | Chap 5. |
| Apr. 14 | Trees | Chap. 6; LECTURE |
| Apr. 16 | Boolean Algebra | Chap. 10; |
| Apr. 18 | Boolean Algebra | Chap. 10 |
| Apr. 21 | Combinatorial Circuits | Chap. 10; Homework 9 due |
| Apr. 23 | Finite Automata | Chap.11; |
| Apr. 25 | Review | |
| May 2 | FINAL EXAM | 8am - 10am |