Schedule · Fall 2026
The semester at a glance
Dates are Mondays. Exam dates are set by the faculty and will be confirmed here and on the WhatsApp channel.
| Week | Date | Topic | Reading | Lab |
|---|---|---|---|---|
| 01 | Sep 21 | Welcome: What Is Discrete Mathematics? Course introduction (held) | Rosen, Preface and 1.1 (skim) | — |
| 02 | Sep 28 | Propositional Logic: Propositions, Connectives, Truth Tables | Rosen 1.1 | lab-01 |
| 03 | Oct 5 | Logical Equivalences and Boolean Circuits | Rosen 1.2–1.3 | lab-02 |
| 04 | Oct 12 | Predicates and Quantifiers | Rosen 1.4 | lab-03 |
| 05 | Oct 19 | Nested Quantifiers and Specifications | Rosen 1.5 | lab-04 |
| 06 | Oct 26 | Rules of Inference | Rosen 1.6 | lab-05 |
| 07 | Nov 2 | Introduction to Proofs | Rosen 1.7–1.8 | lab-06 |
| 08 | Nov 9 | Midterm Exam Midterm week (date to be confirmed by the faculty) | Review Rosen 1.1–1.8 | — |
| 09 | Nov 16 | Sets and Set Operations | Rosen 2.1–2.2 | lab-07 |
| 10 | Nov 23 | Relations and Functions | Rosen 2.3, 9.1, 9.5 | lab-08 |
| 11 | Nov 30 | Sequences, Sums and the Sizes of Infinity | Rosen 2.4–2.5 | lab-09 |
| 12 | Dec 7 | Induction, Recursion and Growth of Functions | Rosen 5.1–5.3, 3.2 | lab-10 |
| 13 | Dec 14 | Counting and the Pigeonhole Principle | Rosen 6.1–6.3 | lab-11 |
| 14 | Dec 21 | Graphs: Models, Terminology and Representations | Rosen 10.1–10.3 | lab-12 |
| 15 | Dec 28 | Connectivity, Coloring and Trees · Project Demo Day Project demo day | Rosen 10.4, 10.8, 11.1 | lab-13 |
| F | Jan 2027 | Final examJanuary 2027, official date announced by the faculty | ||
Modules
How the ideas build on each other
Logic is the grammar, proofs are the method, structures are the vocabulary, and counting and graphs are where it all pays off.
- Module 1 weeks 1–3 p → q
Propositional Logic
Propositions, connectives and truth tables: the same Boolean logic your CPU, your if-statements and every search engine run on.
- Module 2 weeks 4–5 ∀x ∃y
Predicate Logic and Quantifiers
Variables, predicates, ∀ and ∃. Precise specifications for programs and queries, from SQL WHERE clauses to API contracts.
- Module 3 weeks 6–8 ∴
Reasoning and Proof
Rules of inference and proof techniques. How to be certain, and how verified software and theorem provers make machines certain too.
- Module 4 weeks 9–11 A ∩ B
Sets, Relations and Functions
The data types of mathematics: sets, relations, functions, sequences, and the surprising sizes of infinity.
- Module 5 weeks 12–13 n → n+1
Induction, Recursion and Counting
Prove things for every n, reason about recursive code, and count possibilities without listing them.
- Module 6 weeks 14–15 G = (V, E)
Graphs and Trees
Networks, maps, schedules and file systems. Model the connected world and color it without conflicts.