Discrete Mathematics
Optimisation, networks and logic — the mathematics of decisions.
01Linear ProgrammingTurning a worded problem into inequalities, graphing constraints and identifying the feasible region, the objective function, finding the optimum at a vertex, and handling problems that require whole-number answers.100 questions02Assignment ModelsThe assignment problem and why brute force fails, the Hungarian algorithm step by step, a fully worked example, converting a maximisation into a minimisation, handling unbalanced problems with dummies, and reading the answer back into context.100 questions03Graph Theory and Critical Path AnalysisGraph terminology and the handshaking lemma, trees and minimum spanning trees, building an activity network, the forward and backward passes, and identifying the critical path and float.100 questions04Logic and Boolean AlgebraPropositions and connectives, building truth tables, the standard logic gates, the laws of Boolean algebra, De Morgan's laws, and simplifying an expression or circuit to the fewest gates.100 questions