Questions

STANDARD 2
Networks (Std 2), N2 Network Concepts (Y12) 1. Networks, STD2 N2 2010 FUR1 5 MC
Minimum Spanning Trees
Teacher: Gulay Sacan
Exam Equivalent Time: 88.5 minutes (based on allocation of 1.5 minutes per mark)

For the network above, the length of the minimal spanning tree is
A.
B.
IMPORTANT FEATURES AND TIPS FROM EXAM HISTORY
C.
MS-N2 Network Concepts has contributed 4.5% to new syllabus exams since its introduction in 2019.
D.
We have split this area into three categories for the purposes of analysis: Basic Concepts (1.0%),
Shortest Paths (0.5%) and Minimum Spanning Trees (3.0%).
This analysis will look at the largest contributing sub-topic, Minimum Spanning Trees (3.0%).

ANALYSIS - What to Expect and Common pitfalls

Minimum Spanning Trees (3.0%) shows indications of being an exam staple after appearing in every
new syllabus exam to date with meaningful allocations of between 3-4 marks.
The database reflects this importance and besides the growing number of HSC past questions,
includes many supplementary examples informed by the syllabus document, NESA's Networks Topic
Guide, exemplar questions and past VCE exam questions.
Minimum Spanning Trees represents a high scoring opportunity for students. We expect it to regularly
be tested with typical levels of difficulty around the Band 3-4 level.
The worked solutions provide significant detail for solving problems using both Prim's and Kruskal's
algorithms, reflecting the step by step approach outlined in NESA's Networks Topic Guidance
document.
2. Networks, STD2 N2 2013 FUR1 3 MC 3. Networks, STD2 N2 2014 FUR1 5 MC

The vertices of the graph above represent nine computers in a building. The computers are to be
connected with optical fibre cables, which are represented by edges. The numbers on the edges show
the costs, in hundreds of dollars, of linking these computers with optical fibre cables.
Based on the same set of vertices and edges, which one of the following graphs shows the cable
layout (in bold) that would link all the computers with optical fibre cables for the minimum cost?

Which one of the following is the minimal spanning tree for the weighted graph shown above?
4. Networks, STD2 N2 SM-Bank 26 MC 6. Networks, STD2 N2 SM-Bank 1 MC
A weighted network diagram is shown below. This diagram shows the possible paths (in km) for laying gas pipes between various locations.

What is the weight of the minimum spanning tree?

A. 18 Gas is to be supplied from one location. Any one of the locations can be the source of the supply.
B. 19 What is the minimum total length of the pipes required to provide gas to all the locations?
C. 20 A. 32 km
D. 22 B. 34 km
C. 36 km
5. Networks, STD2 N2 SM-Bank 27 MC
D. 38 km
This diagram shows the possible paths (in km) for laying gas pipes between various locations.

7. Networks, STD2 N2 2006 FUR1 4 MC

Gas is be supplied from one location. Any one of the locations can be the source of the supply.
What is the minimum total length of length of the pipes required to provide gas to all the locations?
A. 46 km
The minimal spanning tree for the network above will include the edge that has a weight of
B. 48 km
A.
C. 50 km
B.
D. 52 km
C.
D.
8. Networks, STD2 N2 2007 FUR1 7 MC 9. Networks, STD2 N2 2020 FUR1 5 MC
The minimal spanning tree for the network below includes two edges with weightings and The network below shows the distances, in metres, between camp sites at a camping ground that
has electricity.
The vertices to represent the camp sites.

C 7 D
10
B
8
7 11
10 E 5
x F
A 8

G 6
9
5 7
6

I
H 10
The length of the minimal spanning tree is 19.
The values of and could be
A. The minimum length of cable required to connect all the camp sites is 53 m.
B. The value of , in metres, is at least
C. A. 6
D. B. 8
C. 9
D. 11
10. Networks, STD2 N2 2016 FUR1 4 MC 11. Networks, STD2 N2 2021 FUR1 8 MC
The minimum spanning tree for the network below includes the edge with weight labelled . A network of roads connecting towns in an alpine region is shown below.
The distances between neighbouring towns, represented by vertices, are given in kilometres.

The region receives a large snowfall, leaving all roads between the towns closed to traffic.
To ensure each town is accessible by car from every other town, some roads will be cleared.
The total weight of all edges for the minimum spanning tree is 33.
The minimal total length of road, in kilometres, that needs to be cleared is
The value of is
A. 361 if = 50 and = 55
A.
B. 361 if = 50 and = 60
B.
C. 366 if = 55 and = 55
C.
D. 371 if = 55 and = 65
D.
12. Networks, STD2 N2 2022 HSC 20 13. Networks, STD2 N2 2015 FUR2 1
 Part a: RAP Data - Bottom 20%: School result (96%) was 4% above state average (92%) A factory requires seven computer servers to communicate with each other through a
connected network of cables.
The table below shows the distances, in kilometres, between a number of towns.
The servers, , , , , , and , are shown as vertices on the graph below.

a. Using the vertices given, draw a weighted network diagram to represent the information shown in
the table. (2 marks)

The edges on the graph represent the cables that could connect adjacent computer servers.
The numbers on the edges show the cost, in dollars, of installing each cable.
a. What is the cost, in dollars, of installing the cable between server and server ? (1 mark)

b. What is the cheapest cost, in dollars, of installing cables between server and server ? (1 mark)

c. The computer servers will be able to communicate with all the other servers as long as each server
is connected by cable to at least one other server.
i. The cheapest installation that will join the seven computer servers by cable in a connected
network follows a minimum spanning tree.
Draw the minimum spanning tree on the plan below. (1 mark)
b. A tourist wishes to visit each town.
Draw the minimum spanning tree which will allow for this AND determine its length. (3 marks)

ii. The factory’s manager has decided that only six connected computer servers will be needed,
rather than seven.
How much would be saved in installation costs if the factory removed computer server 14. Networks, STD2 N2 2008 FUR2 1
from its minimum spanning tree network?
A copy of the graph above is provided below to assist with your working. (1 mark) James, Dante, Tahlia and Chanel are four children playing a game.
In this children’s game, seven posts are placed in the ground.
The network below shows distances, in metres, between the seven posts.
The aim of the game is to connect the posts with ribbon using the shortest length of ribbon.
This will be a minimal spanning tree.

a. Draw in a minimal spanning tree for this network on the diagram below. (1 mark)

b. Determine the length, in metres, of this minimal spanning tree. (1 mark)

c. How many different minimal spanning trees can be drawn for this network? (1 mark)
15. Networks, STD2 N2 2011 FUR2 2 16. Networks, STD2 N2 SM-Bank 2
At the Farnham showgrounds, eleven locations require access to water. These locations are A school is designing a computer network between five key areas within the school.
represented by vertices on the network diagram shown below. The dashed lines on the network
The cost of connecting the rooms is shown in the diagram below.
diagram represent possible water pipe connections between adjacent locations. The numbers on the
dashed lines show the minimum length of pipe required to connect these locations in metres.

All locations are to be connected using the smallest total length of water pipe possible.
a. On the diagram, show where these water pipes will be placed. (1 mark)
i. Complete the spanning tree below that creates the school's network at a minimum cost. (1 mark)

b. Calculate the total length, in metres, of water pipe that is required. ( 1 mark)

ii. What is the minimum cost of the network? (1 mark)

17. Networks, STD2 N2 SM-Bank 14 18. Networks, STD2 N2 2007 FUR2 1
Water will be pumped from a dam to eight locations on a farm. A new housing estate is being developed.
The pump and the eight locations (including the house) are shown as vertices in the network There are five houses under construction in one location.
diagram below.
These houses are numbered as points 1 to 5 below.
The numbers on the edges joining the vertices give the shortest distances, in metres, between
locations.

The builders require the five houses to be connected by electrical cables to enable the workers to
i. How many vertices on the network diagram have an odd degree? (1 mark) have a supply of power on each site.
The total length of all edges in the network is 1180 metres. a. What is the minimum number of edges needed to connect the five houses? (1 mark)
The total length of pipe that supplies water from the pump to the eight locations on the farm is a b. On the diagram above, draw a connected graph with this number of edges. (1 mark)
minimum.
This minimum length of pipe is laid along some of the edges in the network.
ii. On the diagram below, draw the minimum length of pipe that is needed to supply water to all
locations on the farm. (2 marks)

iii. What is the mathematical term that is used to describe this minimum length of pipe? (1 mark)
19. Networks, STD2 N2 2017 FUR2 3 20. Networks, STD2 N2 2019 HSC 30
While on holiday, four friends visit a theme park where there are nine rides.  Part a: RAP Data - Bottom 11%: School result (67%) was equal to state average (67%)
On the graph below, the positions of the rides are indicated by the vertices.  Part b: RAP Data - Bottom 11%: School result (54%) was equal to state average (54%)

The numbers on the edges represent the distances, in metres, between rides. The network diagram shows the tracks connecting 8 picnic sites in a nature park. The vertices to
represents the picnic sites. The weights on the edges represent the distance along the tracks
between the picnic sites, in kilometres.

a. Each picnic site needs to provide drinking water. The main water source is at site .
Draw a minimum spanning tree and calculate the minimum length of water pipes required to supply
water to all the sites if the water pipes can only be laid along the tracks. (2 marks)
a. Electrical cables are required to power the rides.
b. One day, the track between and is closed. State the vertices that identify the shortest path from
These cables will form a connected graph. to that avoids the closed track. (1 mark)
The shortest total length of cable will be used.
i. Give a mathematical term to describe a graph that represents these cables. (1 mark)

ii. Draw in the graph that represents these cables on the diagram below. (1 mark)
21. Networks, STD2 N2 2020 HSC 18 22. Networks, STD2 N2 2021 HSC 23
The diagram represents a network with weighted edges.  Part b: RAP Data - Bottom 18%: School result (64%) was 3% above state average (61%)

The network diagram shows the travel times in minutes along roads connecting a number of
C 5 G different towns.
3
A 2 B F
2 2
65
3 1
2 Underwood
2
3
D 4 H 45
2 Kingsville
E 30 20 30
25 40 Citadel
40
a. Draw a minimum spanning tree for this network and determine its length. (3 marks) Queentown
15
b. The network is revised by adding another vertex, . Edges and have weights of 12 and 10 45 10 Parktown 45
respectively, as shown. Minertown Walltown

20 Fernville
K
10
12 a. Draw a minimum spanning tree for this network and determine its length. (3 marks)
C 5 G b. How long does it take to travel from Queentown to Underwood using the fastest route? (1 mark)
3
A 2 B F
2 2
3 1
2
2
3
D 4 H
2
E

What is the length of the minimum spanning tree for this revised network? (1 mark)
23. Networks, STD2 N2 SM-Bank 30 24. Networks, STD2 N2 SM-Bank 34
An amusement park has five toilet areas, , , , and , which are connected by pathways. The following diagram shows the distances, in metres, along a series of cables connecting a main
server to seven points, to , in a computer network.
The table shows the length of some of the pathways, in metres.

The following network diagram is drawn to represent this information and a correct minimum
spanning tree is shown by the solid lines.
Calculate the minimum length of cable, in metres, required to ensure that each of the seven points is
connected to the main server directly or via another point. (2 marks)

Complete the network diagram including a possible value for each of the two edges and ,
and justify why and were not included as part of the minimum spanning tree. (3 marks)
25. Networks, STD2 N2 SM-Bank 3 26. Networks, STD2 N2 SM-Bank 4
The diagram below is a connected network.

Complete the minimal spanning tree of the network above on the diagram below. (2 marks)

Complete the diagram below to show the minimal spanning tree of this network. (2 marks)

27. Networks, STD2 N2 SM-Bank 8

27
F E
31
41

B
D
33
43
36
A
28 C

Highlight the minimal spanning tree of this network on the diagram above, or in a separate diagram.
(2 marks)
28. Networks, STD2 N2 SM-Bank 9 Worked Solutions

1. Networks, STD2 N2 2010 FUR1 5 MC

In a separate diagram or on the diagram above, show the minimum spanning tree . (2 marks)

Copyright © 2004-22 The State of New South Wales (Board of Studies, Teaching and Educational Standards NSW)

2. Networks, STD2 N2 2013 FUR1 3 MC

3. Networks, STD2 N2 2014 FUR1 5 MC 5. Networks, STD2 N2 SM-Bank 27 MC

4. Networks, STD2 N2 SM-Bank 26 MC

6. Networks, STD2 N2 SM-Bank 1 MC 7. Networks, STD2 N2 2006 FUR1 4 MC

8. Networks, STD2 N2 2007 FUR1 7 MC

9. Networks, STD2 N2 2020 FUR1 5 MC 11. Networks, STD2 N2 2021 FUR1 8 MC

10. Networks, STD2 N2 2016 FUR1 4 MC

12. Networks, STD2 N2 2022 HSC 20 13. Networks, STD2 N2 2015 FUR2 1
a. a.

280 530 b.
60

150 790
275 c.i.
MARKER’S COMMENT: Many
students had difficulty finding the
minimum spanning tree, often
incorrectly excluding or .

b.

530
60

275
150

c.ii.
14. Networks, STD2 N2 2008 FUR2 1 15. Networks, STD2 N2 2011 FUR2 2
a. a.

b.

b.

c.
16. Networks, STD2 N2 SM-Bank 2 17. Networks, STD2 N2 SM-Bank 14
i. i.

MARKER’S COMMENT: Many

students, surprisingly, had
ii. problems with part (i).

Staff Room

Library
School Office IT Staff

Computer Room

iii.

ii.
18. Networks, STD2 N2 2007 FUR2 1
a.

b.
19. Networks, STD2 N2 2017 FUR2 3 20. Networks, STD2 N2 2019 HSC 30
a.i. a.

a.ii

b.
21. Networks, STD2 N2 2020 HSC 18 22. Networks, STD2 N2 2021 HSC 23
a. a.

C G
3
A 2 B F Underwood
2
1
2
2 Kingsville
30 20
D H
2 25 Citadel
E 40
Queentown
15
10 Parktown
Minertown Walltown

20 Fernville

b.

b.
23. Networks, STD2 N2 SM-Bank 30 24. Networks, STD2 N2 SM-Bank 34
25. Networks, STD2 N2 SM-Bank 3 26. Networks, STD2 N2 SM-Bank 4

27. Networks, STD2 N2 SM-Bank 8

28. Networks, STD2 N2 SM-Bank 9

Copyright © 2016-2023 M2 Mathematics Pty Ltd (SmarterMaths.com.au)