FeaturesHow It WorksFor ParentsPricingContactLog inStart free — no credit card needed →

General Mathematics · Unit 4 · Networks and decision mathematics 1 · Trees and minimum connector problems

Determine a minimum spanning tree in a weighted connected graph.

Practise this objective

AI-marked practice questions tied to QCAA mark schemes for this exact LO. Free to start.

Start free practice

Practice questions for this objective

Full questions, answers and worked solutions unlock when you start a free practice session.

Question 1

The table shows the cost (in thousands of dollars) to construct fibre-optic cables between five server hubs labelled \( H \), \( J \), \( K \), \( L \) and \( M \). Determine the minimum total cost to connect all hubs and identify which cables are required.

Worked answer
🔒 Start free to see full answer
Question 2

A telecommunications company plans to connect seven regional offices (labelled \(J\), \(K\), \(L\), \(M\), \(N\), \(P\), and \(Q\)) with fibre-optic cable. The table shows the cost (in thousands of dollars) of installing cable along each possible direct route between offices. Determine the minimum total cost to connect all seven offices and identify which routes should be used.

Worked answer
🔒 Start free to see full answer
Unlock all 2 answers — free

More in Trees and minimum connector problems

Next →
Solve practical problems involving minimum spanning trees, e.g. minimising the length of cable needed to provide power from a single power station to substations in several towns.
All LOs in Trees and minimum connector problemsBack to full General Mathematics syllabus