General Mathematics · Unit 4 · Networks and decision mathematics 1
Worked examples
12 worked examples, each solved step by step with the reasoning behind every move. Try one yourself first, then reveal the working.
Lesson 1Trees and spanning trees
Open the lesson- Counting the spanning trees of a small graphComplex familiarTechnology-freeTrees and spanning trees
Lesson 2Finding minimum spanning trees
Open the lesson- Kruskal's method on the camp-site tracksSimple familiarTechnology-freeFinding minimum spanning trees
- Prim's method from A on the camp-site tracksSimple familiarTechnology-freeFinding minimum spanning trees
- A graph with two minimum spanning treesComplex familiarTechnology-freeFinding minimum spanning trees
Lesson 3Minimum connector problems
Open the lesson- Power lines to the Western DownsComplex familiarWith or without technologyMinimum connector problemsFinding minimum spanning trees
- When a route is not availableComplex unfamiliarWith or without technologyMinimum connector problems
Lesson 4Precedence tables and project networks
Open the lesson- Drawing the garden shed networkSimple familiarTechnology-freeProject networks
Lesson 5Forward scanning and earliest starting times
Open the lesson- Forward scan of the kitchen renovationSimple familiarTechnology-freeEarliest starting times
Lesson 6Backward scanning, latest starting times and float
Open the lesson- Backward scan and floats for the kitchen renovationComplex familiarTechnology-freeLatest starting timesFloat times
Lesson 7Critical paths and the minimum completion time
Open the lesson- A project with two critical pathsComplex familiarTechnology-freeCritical pathsFloat times
Lesson 8Solving scheduling problems
Open the lesson- What do the delays do to the garden?Complex unfamiliarTechnology-freeScheduling problemsFloat times
- Opening the garden soonerComplex unfamiliarWith or without technologyScheduling problemsCritical paths