Decision Mathematics A Level Further Maths Worksheets, Questions and Revision
6 original Decision Mathematics worksheet packs - 102 printable pages with full mark schemes. Algorithms, graph theory, critical path analysis and linear programming. View any pack in the browser or open the print-ready PDF.
- packs
- 6
- question pages
- 73
- printable pages
- 102
- Full PackRevise this topic: Decision Maths: Algorithms, Sorting and Bin Packing
More formats: Decision Maths: Algorithms, Sorting and Bin Packing
- Full PackRevise this topic: Decision Maths: Graphs, Trees and Minimum Spanning Trees
More formats: Decision Maths: Graphs, Trees and Minimum Spanning Trees
- Full PackRevise this topic: Decision Maths: Shortest Paths and Route Inspection
More formats: Decision Maths: Shortest Paths and Route Inspection
- Full PackRevise this topic: Decision Maths: Critical Path Analysis and Linear Programming
More formats: Decision Maths: Critical Path Analysis and Linear Programming
- Full PackRevise this topic: Decision: Algorithms and Graph Theory Depth
More formats: Decision: Algorithms and Graph Theory Depth
- Full PackRevise this topic: Decision: Linear Programming and Critical Path Depth
More formats: Decision: Linear Programming and Critical Path Depth
Free for personal and classroom use - see copyright & terms.
The list 25, 11, 33, 4, 18, 7 is to be sorted into ascending order using quick sort, choosing the first item of each sublist as the pivot. Carry out the full sort, showing the sublists produced at each stage.
- First pivot = 25 (the first item). Comparing each remaining item (11, 33, 4, 18, 7) to 25: those less than 25 form the sublist [11, 4, 18, 7] in their original order, and those greater form the sublist [33]. This gives [11, 4, 18, 7] | 25 | [33].
- The sublist [33] has one item, so it needs no further sorting. Apply quick sort to [11, 4, 18, 7]: pivot = 11. The remaining items 4, 18, 7 split into [4, 7] (less than 11) and [18] (greater than 11), giving [4, 7] | 11 | [18].
- [18] has one item, so it is done. Apply quick sort to [4, 7]: pivot = 4. The remaining item 7 is greater than 4, so the less-than sublist is empty and the greater-than sublist is [7], giving 4 | [7].
- Every sublist now has at most one item, so sorting is complete. Reading the sublists in order gives 4, 7, 11, 18, 25, 33.
- Final answer: sorted list is 4, 7, 11, 18, 25, 33.
Choosing and checking a Decision method
Decision mathematics starts with a precise rule for making choices. A successful solution records how that rule changes a list, network or schedule, so somebody else can follow the same route to the result. The sheets on this page group algorithms, graphs, optimisation and project planning under Decision. Begin by matching the topic to the problem you want to practise: sorting a list, connecting a network, finding a route and organising activities call for different methods, even when their diagrams or tables look similar.
Use your course topic list to choose from this collection, especially before opening the depth sheets. Their presence in the library is a choice of practice material, rather than a statement that every board or option requires every method here. If the opening instruction names an algorithm, follow its stated conventions instead of replacing it with a quicker calculation. The accompanying topic guide can help with an unfamiliar rule; the worksheet then gives space to record the full trace. Keep the mark scheme closed until your trace has reached its stopping condition.
Sorting means preserving the stated rule
For quick sort, the pivot convention is part of the task. Choosing the first item means using the first item again within each new sublist, rather than choosing the smallest value or the middle position. Preserve the order of the remaining values as you partition them. A singleton needs no further split; an empty sublist also needs no work. Read the completed branches from left to right to recover the sorted list. The existing example below keeps every split visible, including the empty branch at the last partition.
Bubble sort has a different trace: adjacent values are compared while moving through the list in the stated direction. One pass does not usually sort the whole list. For bin packing, distinguish the order of the items from the order in which bins are tested. First-fit decreasing sorts the items first, but still checks bins from the first bin onwards for each placement. A lower bound is rounded up because a fraction of a bin cannot hold the remaining items.
Worked example. The list 25, 11, 33, 4, 18, 7 is to be sorted into ascending order using quick sort, choosing the first item of each sublist as the pivot. Carry out the full sort, showing the sublists produced at each stage.
- First pivot = 25 (the first item). Comparing each remaining item (11, 33, 4, 18, 7) to 25: those less than 25 form the sublist [11, 4, 18, 7] in their original order, and those greater form the sublist [33]. This gives [11, 4, 18, 7] | 25 | [33].
- The sublist [33] has one item, so it needs no further sorting. Apply quick sort to [11, 4, 18, 7]: pivot = 11. The remaining items 4, 18, 7 split into [4, 7] (less than 11) and [18] (greater than 11), giving [4, 7] | 11 | [18].
- [18] has one item, so it is done. Apply quick sort to [4, 7]: pivot = 4. The remaining item 7 is greater than 4, so the less-than sublist is empty and the greater-than sublist is [7], giving 4 | [7].
- Every sublist now has at most one item, so sorting is complete. Reading the sublists in order gives 4, 7, 11, 18, 25, 33.
- Final answer: sorted list is 4, 7, 11, 18, 25, 33.
Answer: Final answer: sorted list is 4, 7, 11, 18, 25, 33.
Separate the network objectives
The graphs and trees sheet concerns connecting vertices without cycles at minimum total weight. Kruskal considers candidate edges in weight order and rejects a cycle; Prim extends the tree already being grown. Keep the accepted edges separate from the rejected ones so that the total includes only the finished tree. A shortest-path calculation instead measures a route from a start vertex. Record predecessors alongside labels so that the route itself can be reconstructed, rather than reporting only its length.
Route inspection asks for edge coverage and a return to the start. Mark the odd-degree vertices and compare the possible pairings before deciding which paths must be repeated. Critical path analysis uses precedence rather than distance: the forward pass waits for every predecessor, while the backward pass respects the earliest deadline imposed by successors. In linear programming, retain the meaning of each variable and check candidate vertices against all constraints before comparing objective values. These checks address the model as well as the arithmetic.
Use the Decision sheets to diagnose a trace
Choose Algorithms, Sorting and Bin Packing to practise list operations, or move to the network and planning sheets when your difficulty concerns labels, edges or dependencies. Attempt a complete procedure on paper before reading its solution. While marking, locate the first state that differs from the scheme: an incorrect pivot, omitted edge test or wrong predecessor can explain several later differences. Correct that state and continue the procedure yourself, then compare the ending. This is more informative than copying a finished diagram.
Use the depth material for algorithms and graph theory or for linear programming and critical paths when those topics match your study plan. Explain each decision beside the working, such as why an edge would close a cycle or why a candidate point violates a constraint. Revisit the sheet after a gap and repeat the method without consulting the trace. Keep a short note of the decision you missed so that your next attempt tests that specific habit.