Immutable package version
publiccourseMCF 1.1
Discrete Mathematics 0.2.0
Published by @apv on August 12, 2026.
- Source checksum
13d745d472eb2ec60baa1166b29a6c4873e8736fc7e52a342620efc9df93566e- Package size
- 92.9 KiB
- Validation
- valid · 0 diagnostics
- Manifest ID
courses.theoria.polytechnical.discrete-mathematics- Manifest version
- 0.2.0
- Entry
undefined- Language
- en-CA
- License
- CC-BY-4.0
- Authors
- APV, Theoria
- Subjects
- mathematics, discrete mathematics, combinatorics, graph theory, recurrences, logic, finite-state systems
- Level
- foundational
- Structure
- 33 lessons · 57 activities · 168 questions
Learning outcomes
- Model finite sets, relations, and functions and prove discrete claims using induction, pigeonhole arguments, and invariants.
- Derive counts using sum/product rules, permutations/combinations, inclusion–exclusion, and binomial identities.
- Read, solve, and asymptotically analyse simple recurrences.
- Represent graphs and analyse paths, connectivity, degree invariants, Euler structure, trees, and spanning structure.
- Trace BFS, DFS, Dijkstra, and topological sorting and state the assumptions supporting their guarantees.
- Use equivalence relations, partitions, partial orders, and Hasse diagrams to model finite structure.
- Reason with Boolean algebra and finite-state machines, including truth-table equivalence and state invariants.
- Integrate graph, recurrence, counting, order, and finite-state reasoning in a resilient dependency/network analysis.
Release notes
No release notes were provided.
Canonical source is immutable
This release points to the validated source `.mcf.zip`. Browser-compiled learner output is derived and is not treated as repository source.