course
Discrete Mathematics
Discrete reasoning for computing: finite structures, induction, counting, recurrences, graphs, trees, graph algorithms, relations/order, Boolean algebra, and finite-state systems.
By @apv
- Version
- 0.2.0
- Format
- 1.1
- Language
- en-CA
- Level
- foundational
- License
- CC-BY-4.0