Theoria
Portable learning

Published course

coursePublished source available

Course details

About this course

Level
foundational
Language
en-CA
License
CC-BY-4.0
Duration
Not declared
Curriculum
Not declared
Prerequisites
Not declared
Attribution
APV, Theoria

Technical metadata

Package format and contents

Show technical package details
Format version
MCF 1.1
Lessons
33
Activities
57
Questions
168
Files / assets
Not reported / Not reported
Validation
valid

Learning outcomes

What learners can expect

  1. Model finite sets, relations, and functions and prove discrete claims using induction, pigeonhole arguments, and invariants.
  2. Derive counts using sum/product rules, permutations/combinations, inclusion–exclusion, and binomial identities.
  3. Read, solve, and asymptotically analyse simple recurrences.
  4. Represent graphs and analyse paths, connectivity, degree invariants, Euler structure, trees, and spanning structure.
  5. Trace BFS, DFS, Dijkstra, and topological sorting and state the assumptions supporting their guarantees.
  6. Use equivalence relations, partitions, partial orders, and Hasse diagrams to model finite structure.
  7. Reason with Boolean algebra and finite-state machines, including truth-table equivalence and state invariants.
  8. Integrate graph, recurrence, counting, order, and finite-state reasoning in a resilient dependency/network analysis.

Immutable releases

Version history

  1. 0.2.0course · MCF 1.1 · 92.9 KiB

Repository network

0 stars · 0 forks

This repository is an original publication.

No public direct forks yet.