MathematicsCoreMTH-DISC-117
Trees
properties, spanning trees, Kruskal/Prim algorithms
- Difficulty
- 3 / 5
- Importance
- 4 / 5
- Study time
- 4–7.5 h
- Kind of work
- Mixed
Why it matters
The mathematics of discrete structures underlying computer science, combinatorics and modern applied math.
Where it is used
Algorithms and data structures, networks, cryptography, probability counting, game design, scheduling.
How you know you have learned it
Solve ≥10 representative problems with ≥80% adjusted accuracy.
Resources
- Discrete Mathematics and Its Applications (Rosen) — Kenneth Rosen Book
- Discrete Mathematics and Its Applications (Rosen) — Kenneth Rosen Book
- Concrete Mathematics — Graham, Knuth & Patashnik Book