REVISION
ON
NETWORKS
2


QUESTIONS

Multiple-choice questions 

1 Consider this network graph.











A subgraph of this graph is:













2 The diagrams show four connected planar graphs.













Equivalent graphs are:
A J and L only B J and K and L only C J and K and M only
D J and L and M only E J and K and L and M



o
3 The diagram shows a map of the roads between four towns, F, G, H and I.











A network diagram that represents all the connections between the four towns on the map
is:








4 Five people are to be each allocated one of five tasks ( A, B, C, D, E ). The table shows
the time, in hours, that each person takes to complete the tasks. The tasks must be
completed in the least possible total amount of time. If no person can help another,
Francis should be allocated task:













AA BB CC DD EE


5 The sum of the degrees of all the vertices in the network below is:
A6 B7 C8 D 15 E 16

6 Adding which one of the following edges creates an Euler path?

A ST B SU C SX D XW E ZY

7 A connected planar graph has an equal number of vertices and faces. If there are 20
edges in this graph, the number of vertices must be:
A9 B 10 C 11 D 20 E 22

8 Underground water pipes are needed to water a new golf course. Water will be pumped
from the dam in the back corner of the course. To find the smallest total length of water
pipe needed, we must find:
A a critical path
B a minimal spanning tree
C the shortest Euler circuit
D the shortest Hamiltonian circuit
E the perimeter of the golf course

9 Which one of the following is a true statement about a critical path in a project?
A Knowledge of the critical path can be used to decide if any tasks in a project can be
delayed without extending the length of time of the project.
B All tasks on the critical path must be completed before any other task in the same
project can be started.
C Decreasing the times of tasks not on the critical path will decrease the length of time of
the project.
D The critical path must always include at least two tasks in a project.
E There is only one critical path in any project.
10 For the directed graph shown, vertex O cannot be reached from vertex:

AL BM CN DP EQ

11 The network gives the times in hours to complete the 12 tasks required to finish a
project. The critical path for this project is:

A J-P-U B K-R-T-U C J-M-O-S-U

D K-N-Q-T-U E K-N-M-O-S-U

12 The shortest path between the origin, O, and destination, D, in the network shown
here is:







A 11 B 12 C 13 D 14 E 15
13 Four students, talking about five ski resorts they have visited, represented their
information on the bipartite graph shown here. Which one of the following statements is
implied by this bipartite graph?










A Ann and Maria between them have visited fewer ski resorts than Matt and Tom
between them.
B Matt and Tom have been to four ski resorts between them.
C Maria has visited fewer ski resorts than any of the others.
D Ann and Maria between them have visited all five ski resorts discussed.
E Ann and Tom between them have visited fewer resorts than Matt and Maria between
them.


14 A gas pipeline is to be constructed to link several towns in the country. Assuming the
pipeline construction costs are the same everywhere in the region, the cheapest network
formed by the pipelines and the towns as vertices would form:
A a Hamilton circuit
B an Euler circuit
C a minimum length spanning tree
D a critical path
E a complete graph

15 Which one of the following statements is not implied by this bipartite graph?
A There are more translators of French than Greek.
B Sally and Kate can translate five languages between them.
C Jon and Greg can translate four languages between them. Spanish Italian Greek
Turkish French Sally Kate Jon Greg
D Kate and Jon can translate more languages between them than can Sally and Greg.
E Sally and Jon can translate more languages between them than can Kate and Greg.

16 There are four different human blood types: O, A, B and AB. The relationships
between donor and recipients for these blood types are as follows:
Type O can donate blood to any type.
Type AB can receive blood from any type.
Each type can donate blood to its own type.
Each type can receive blood from its own type.
Which one of the following donor–recipient bipartite graphs correctly represents this
information?

17 For the weighted graph shown, the length (total weight) of the minimum spanning tree
is:

A 28 B 29 C 30 D 31 E 32
19 What additional arc could be added to the graph to ensure the resulting graph would
contain an Euler circuit?

A AB B AC C AD D AE E BC

20 This network represents a project development with activities listed on the arcs of the
graph. Which of the following statements must be true?

A A must be completed before B can start.

B A must be completed before F can start.
C E and F must start at the same time.
D E and F must finish at the same time.
E E cannot start until A is finished.
Extended-response questions
1 The network diagram shows the distances, in kilometres, along a series of roads that
connect a quarry, Q, with worksites shown as nodes.

a One of these worksites is labelled as W.

i Indicate the shortest path from the quarry to W.
ii Determine the length, in kilometres, of the shortest path between the quarry Q and the
worksite W.
b The engineer at the quarry wants to visit all worksites in the network. Beginning at Q,
he wants to pass through each worksite only once before returning to the quarry.
i What mathematical term describes the route the engineer wants to take?
ii Show a complete route that the engineer could take to visit each worksite only once
before returning to the quarry. [VCAA 2000]

2 All the activities and their durations (in hours) in a project at the quarry are shown in
the network diagram below. The least time required for completing this entire project is
30 hours.
For each activity in this project, the table on the next page shows the completion time, the
earliest starting time and the latest starting time.

a Complete the missing times in the table.

b Write down the critical path for this project.
To speed up the project, several activities can be dropped. The diagram below shows the
activities that must remain in this modified version of the project and their usual
completion times.
c Determine the shortest time in which this modified project can be completed.
The completion time of some of the remaining activities in the modified project can be
reduced at a cost.
This table shows the reduced times (least possible time to complete an activity after
maximum reduction of time).
The cost of this reduction, per hour, is also shown.

d For this modified project, determine:

i the activities that should be reduced in time to minimise the completion time of the
project
ii the maximum time, in hours, that can be saved by this reduction
iii the minimum cost to achieve this time saving
3 A train journey consists of a connected sequence of stages formed by edges on the
directed network from Arlie to Bowen. The number of available seats for each stage is
indicated beside the corresponding edge, as shown in the diagram.

The five cuts, A, B, C, D and E, shown on the network, are attempts to find the
maximum number of available seats that can be booked for a journey from Arlie to
Bowen.
a Write down the capacity of cut A, cut B and cut C.
b Cut E is not a valid cut when trying to find the minimum cut between Arlie and Bowen.
Why?
c Determine the maximum number of available seats for a train journey from Arlie to
Bowen.

4 The Bowen Yard Buster team specialises in backyard improvement projects. The team
has identified the activities required for a backyard improvement. The network diagram
on the next page shows the activities identified and the actual times, in hours, needed to
complete each activity, that is, the duration of each activity.
The table lists the activities, their immediate predecessor(s) and the earliest starting times
(EST), in hours, of each of the activities. Activity X is not yet drawn on the network
diagram.
5Tosavemoney,BowenYardBustersdecidetorevise
The network for this project is as shown.

Using normal completion times as given in Table 1, determine the times missing from Table 2 .
f Determine the shortest distance that a fire truck stationed at E must travel to assist at an
emergency at A.
e State the critical path.
f If the final activity, K, had to be delayed, how many days could this delay take before
the project schedule was disrupted?
The actual time to complete an activity is not known for sure. A pessimistic assessment
of the activity duration (i.e. the longest time likely to occur) can also be used to assess the
project, as given in Table 2.
ANSWERS