References:
1) Textbook: Kenneth H. Rosen, Discrete Mathematics and Its Applications, Seventh Edition, McGraw Hill, 2012.
2) Lecture notes
| Week 1 | ||
| Jan 09 | Intro to Discrete Structures | |
| Jan 11 | Review of propositional logic (Ch 1.1, 1.2, 1.3) | |
| Week 2 | ||
| Jan 16 | Predicate Logic. (Ch 1.4, 1.5) | |
| Jan 17 (TUT 1) | Chapter 1.1: 2, 4,10, 16, 18, 28, 32, 44, 50 Chapter 1.3: 8, 10,14,26,34,38, 60. | |
| Jan 18 | Predicate Logic. (Ch 1.4, 1.5) | |
| Week 3 | ||
| Jan 23 | Inference rules and proof methods (Ch 1.6, 1.7, 1.8) | |
| Jan 24 (TUT 2) | Chapter 1.4: 6, 16, 18, 28, 36, 52, 62 Chapter 1.5: 2, 6, 8, 14, 22, 30, 36, 44 | |
| Jan 25 | Inference rules and proof methods (Ch 1.6, 1.7, 1.8) | |
| Week 4 | ||
| Jan 30 | Inference rules and proof methods (Ch 1.6, 1.7, 1.8) | |
| Feb 31 (TUT 3) | Chapter 1.6: 2, 6, 8, 14, 20 Chapter 1.7: 6, 8, 18, 24, 32 | |
| Feb 1 | Number Theory (division, modular arithmetic, Primes, GCD, Euclidean Algorithm, ...) (Ch 4.1, 4.3, 4.4, 4.5, 4.6) | |
| Week 5 | ||
| Feb 6 | Number Theory (division, modular arithmetic, Primes, GCD, Euclidean Algorithm, ...) (Ch 4.1, 4.3, 4.4, 4.5, 4.6) | |
| Feb 7 (TUT 4) | Chapter 1.8: 2, 6, 14, 16, 22, 32, 34, 38, 42, 44 | |
| Feb 8 | Number Theory (division, modular arithmetic, Primes, GCD, Euclidean Algorithm, ...) (Ch 4.1, 4.3, 4.4, 4.5, 4.6) | |
| Week 6 | ||
| Feb 13 | Number Theory (Fermat's Little Theorem, RSA cryptosystem) (Ch 4.7) | |
| Feb 14 (TUT 5) | Chapter 4.1: 14 (a, d, f), 22 (a, c) Chapter 4.3: 4, 12 Chapter 4.4: 6, 10, 12, 22 | |
| Feb 15 | Number Theory (Fermat's Little Theorem, RSA cryptosystem) (Ch 4.7) | |
| Feb 20 - 22, 2017 | Reading week | |
| Week 7 | ||
| Feb 27 | Review | |
| Feb 28 (TUT 6) | Chapter 4.3: 14, 24, 30, 32 (c, d) Chapter 4.4: 24, 34, 46 | |
| Mar 1 | Midterm Test @ room STEA0150 (STEF0126) at 8:30-9:45 | |
| Week 8 | ||
| Mar 6 | Induction (Ch 5.1) | |
| Mar 7 (TUT 7) | Chapter 4.6: 2(a), 24, 32 Chapter 5.1: 6, 20, 34, 54, 60 | |
| Mar 8 | Strong Induction (Ch 5.2) | |
| Week 9 | ||
| Mar 13 | Recursive definitions and structural induction. (Ch 5.3) | |
| Mar 14(TUT 8) | Chapter 5.2: 10, 12, 14, 30, 32, Chapter 5.3: 4, 6, 12, 24, 44 Chapter 5.4: 8, 24, 38 | |
| Mar 15 | Correctness of recursive algorithms. Program correctness and verification (Ch 5.4, 5.5) | |
| Week 10 | ||
| Mar 20 | Recurrence relations (Ch 8.1, 8.2) | |
| Mar 21 (TUT 9) | Chapter 8.2: 2, 4 (2 or 3 examples from 4), 26, 32, 34 | |
| Mar 22 | Recurrence relations (Ch 8.2, 8.3) | |
| Week 11 | ||
| Mar 27 | Graphs (selection from Ch 10 & 11) | |
| Mar 28 (TUT 10) | Chapter 10.2: 24, 40, 50, 60 Chapter 10.3: 36, 46, 54 (c) Chapter 10.4: 12 (b) Chapter 10.5: 18, 32, 34 | |
| Mar 29 | Graphs (selection from Ch 10 & 11) | |
| Week 12 | ||
| Apr 3 | Graphs (selection from Ch 10 & 11) | |
| Apr 4 (TUT 11) | Chapter 10.7: 6, 8; Chapter 10.8: 8, 16 | |
| Apr 5 | Graphs (selection from Ch 10 & 11) |