General Maths · Topic quiz
Networks and decision mathematics 2 quiz
10 questions across the topic, from foundation to complex unfamiliar, the way the exam mixes them. You see how you went at the end, with a worked solution for every question.
Difficulty
- 38 min on the clock: the working time each question needs. The quiz ends when time is up.
- No calculator needed: this topic’s questions are technology-free.
- Multiple choice, short response, graph interpretation and worked response. Answer in any order and change answers until you finish.
What it covers
- Reading flow networks
- Identifying cuts
- Capacity of a cut
- Minimum cut and maximum flow
- Flow network problems
- Bipartite graphs and allocation tables
- Assignment by inspection
- Steps of the Hungarian algorithm
- Minimum assignment (Hungarian)
- Maximum assignment
Each quiz is drawn fresh, so taking it again gives new questions. Your results update your mastery for this topic.
Revise first
The quiz draws on all 7 lessons in Networks and decision mathematics 2, and the 10 worked examples show the same kinds of questions solved step by step.
- Flow networks: sources, sinks and capacitiesRead a flow network — its source, sink and edge capacities — find the most that can flow along a single path, and use the rule that flow in equals flow out at every junction.
- Cuts and their capacityRecognise a cut in a flow network, name its source and sink sides, and find its capacity by adding only the edges that cross from the source side to the sink side.
- Minimum cut and maximum flowList every cut of a small flow network systematically, find the minimum cut, and use the maximum flow–minimum cut theorem to state the maximum flow, confirming it with a flow that reaches it.
- Solving practical flow problemsModel roads, pipes and paths as flow networks, find the maximum flow, turn it into times and totals, and decide which upgrade would actually increase the flow.
- Allocation problems and bipartite graphsRepresent an allocation problem as a bipartite graph and as a table or matrix, then find the best allocation of a small problem by inspection.
- The Hungarian algorithm for a minimumUse row reduction, column reduction, covering lines and the adjustment step to find the allocation with the smallest total cost or time for a 3 × 3 to 5 × 5 problem.
- Maximum assignments and more than one optimumFind the allocation with the largest total by converting a maximum problem into a minimum one, and find every optimal assignment when there is more than one.