- algorithms19 questions
- algorithms/binary-search4 questions
- algorithms/bubble-sort9 questions
- algorithms/bubble-sort/reverse-trace4 questions
- algorithms/quick-sort11 questions
- algorithms/trace-and-interpret3 questions
- bin-packing15 questions
- bin-packing/first-fit11 questions
- bin-packing/first-fit-decreasing13 questions
- bin-packing/infer-capacity2 questions
- bin-packing/lower-bound7 questions
- critical-path-analysis26 questions
- critical-path-analysis/cascade-chart9 questions
- critical-path-analysis/changing-activity-durations6 questions
- critical-path-analysis/compulsory-overlap8 questions
- critical-path-analysis/critical-activities19 questions
- critical-path-analysis/draw-activity-network12 questions
- critical-path-analysis/dummy-activities14 questions
- critical-path-analysis/event-times15 questions
- critical-path-analysis/read-precedence-table3 questions
- critical-path-analysis/scheduling7 questions
- critical-path-analysis/total-float9 questions
- critical-path-analysis/workload-lower-bound9 questions
- graph-theory6 questions
- graph-theory/network-and-matrix2 questions
- graph-theory/properties4 questions
- linear-programming24 questions
- linear-programming/algebraic-optimisation6 questions
- linear-programming/draw-feasible-region7 questions
- linear-programming/eliminate-a-variable12 questions
- linear-programming/formulation13 questions
- linear-programming/integer-solutions2 questions
- linear-programming/objective-line7 questions
- linear-programming/objective-parameter7 questions
- linear-programming/read-constraints8 questions
- linear-programming/recover-objective3 questions
- linear-programming/redundant-constraint1 question
- linear-programming/vertex-method2 questions
- matching2 questions
- minimum-spanning-tree17 questions
- minimum-spanning-tree/infer-edge-weights2 questions
- minimum-spanning-tree/kruskal6 questions
- minimum-spanning-tree/prim12 questions
- route-inspection15 questions
- route-inspection/changed-network2 questions
- route-inspection/closed-route10 questions
- route-inspection/open-route12 questions
- route-inspection/open-route/choose-endpoints6 questions
- route-inspection/unknown-edge-weight3 questions
- route-inspection/vertex-visit-count4 questions
- shortest-path15 questions
- shortest-path/dijkstra15 questions
- shortest-path/parameter-dependent2 questions
- shortest-path/via-a-specified-vertex4 questions
- travelling-salesman13 questions
- travelling-salesman/classical-vs-practical2 questions
- travelling-salesman/compare-bounds8 questions
- travelling-salesman/deleted-vertex-lower-bound13 questions
- travelling-salesman/expand-tour2 questions
- travelling-salesman/least-distance-table2 questions
- travelling-salesman/mst-upper-bound6 questions
- travelling-salesman/mst-upper-bound/shortcuts1 question
- travelling-salesman/nearest-neighbour13 questions