Discrete Math·Course
Discrete Mathematics
Discrete mathematics: logic, set theory, combinatorics, graph theory, algorithms, and number theory
5
Modules
15
Articles
~2 h
Reading
IV
CLOs
§ 01 — Curriculum
5 modules.
Each module is a small unit. Most read in sequence — but a determined reader can begin anywhere.
- M ISets and RelationsSet theory, binary relations, order, and equivalence3 articles
18 minBegin → - M IIBoolean Functions and Post's TheoremCompleteness of systems of Boolean functions, closed classes3 articles
18 minBegin → - M IIIGraph TheoryConnectivity, trees, planarity, colorings3 articles
18 minBegin → - M IVCombinatoricsInclusion–exclusion principle, generating functions3 articles
18 minBegin → - M VAutomata and Formal LanguagesFinite automata, regular languages, Kleene’s theorem3 articles
18 minBegin →
§ 02 — Learning outcomes
4 outcomes.
CLO I
Logic and Sets
Apply methods of mathematical logic and set theory
CLO II
Combinatorics
Solve combinatorial problems involving permutations, combinations, and the inclusion–exclusion principle
CLO III
Graph Theory
Analyze graphs and determine paths, spanning trees, and flows
CLO IV
Number Theory and Algorithms
Apply number-theoretic algorithms and assess algorithmic complexity
§ 03 — Practices