| CPSC 203: Mathematical Foundations of Computing | Fall 2025 |
| Week | Date | Topics | Reading | Homework |
| 1 | Sept. 3, 5 | Propositional logic | §§1.1–1.4 | Homework 1 |
| 2 | Sept. 8, 10, 12 | Proof techniques | §§1.6–1.8 | Homework 2 |
| 3 | Sept. 15, 17, 19 | Sets, functions and sequences | §§2.1–2.4 | Homework 3 |
| 4 | Sept. 22, 24, 26 | Algorithms and complexity | §§3.1–3.3 | |
| 5 | Sept. 29, Oct. 1, 3 | Integer and modular arithmetic | §§4.1–4.3 | |
| 6 | Oct. 6 (Mon.) Oct. 8, 10 |
Exam 1, in class Cryptography |
§§4.4–4.6 |
|
| 7 | Oct. 13, 14 Oct. 15, 17 |
Trinity Days Relations |
§§9.1, 9.5 |
|
| 8 | Oct. 20, 22, 24 | Induction | §§5.1, 5.2 | |
| 9 | Oct. 27, 29, 31 | Recursion and program correctness | §§5.3–5.5 | |
| 10 | Nov. 3, 5, 7 | Counting | §§6.1–6.3 | |
| 11 | Nov. 10 (Mon.) Nov. 12, 14 |
Exam 2, in class Discrete Probability |
§§7.1, 7.2 |
|
| 12 | Nov. 17, 19, 21 | Recurrences | §§8.1, 8.2 | |
| 13 | Nov. 24 Nov. 26–28 |
Analysis of recursive algorithms Thanksgiving vacation |
§8.3 |
|
| 14 | Dec. 1, 3, 5 | Graphs | §§10.1–10.5 | |
| 15 | Dec. 8 | Trees | §§11.1, 11.2 | |
| Dec. 12 (Fri.) | Final exam |
|
|
CPSC 203 home page |
|
|