General Maths · Topic quiz
Networks and decision mathematics 1 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
- 41 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
- Trees and spanning trees
- Finding minimum spanning trees
- Minimum connector problems
- Project networks
- Earliest starting times
- Latest starting times
- Critical paths
- Float times
- Scheduling problems
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 8 lessons in Networks and decision mathematics 1, and the 12 worked examples show the same kinds of questions solved step by step.
- Trees and spanning treesRecognise trees and spanning trees, explain why a tree with vertices has edges, and find the spanning trees of a small graph.
- Finding minimum spanning treesFind a minimum spanning tree and its weight by inspection, with Kruskal's method and with Prim's method, and recognise when there is more than one.
- Minimum connector problemsModel practical cable, pipe and path problems as minimum spanning trees, cost them, and adapt the method when a link must be used or cannot be used.
- Precedence tables and project networksRead a precedence table, and draw a project as an activity-on-arc network with each activity as a labelled arrow and each event as a numbered circle.
- Forward scanning and earliest starting timesScan a project network from start to finish to find the earliest starting time of every activity and the minimum time in which the project can be completed.
- Backward scanning, latest starting times and floatScan a project network from the finish back to the start to find the latest starting time of every activity, then calculate each activity's float.
- Critical paths and the minimum completion timeUse ESTs and LSTs to locate the critical path or paths of a project, and explain why their length is the minimum completion time.
- Solving scheduling problemsUse critical path analysis to decide what a delay does to a project, how far a project can be shortened, and how to justify scheduling decisions in context.