Mathematics Applications Unit 3: Semester One Examination, 2022 Question/Answer Booklet
Mathematics Applications Unit 3: Semester One Examination, 2022 Question/Answer Booklet
Question/Answer booklet
MATHEMATICS
APPLICATIONS
If required by your examination administrator, please
UNIT 3 place your student identification label in this box
Section One:
Calculator-free
WA student number: In figures
In words
Section Two:
12 12 100 98 65
Calculator-assumed
Total 100
Instructions to candidates
Question 1 (5 marks)
The statements in parts (a) to (e)
of this question relate to graph 𝐺
shown at right.
Question 2 (5 marks)
The graph below shows the first few terms of an arithmetic sequence and a geometric sequence.
Question 3 (7 marks)
(a) Graph 𝐺1 is shown at right.
(2 marks)
DO NOT WRITE IN THIS AREA AS IT WILL BE CUT OFF
(b) A haulage company has three trucks and four drivers. The drivers that are licensed to
drive each of the trucks are shown with a tick in the following table.
Driver
A B C D
1 ✓ ✓ ✓
Truck 2 ✓ ✓ ✓ ✓
3 ✓ ✓ ✓
(ii) Graph 𝐺2 can be drawn in the plane. Determine, with justification, the number of
faces 𝐺2 has. (2 marks)
(c) Describe the linear association between the variables in terms of direction and strength.
(2 marks)
(d) Interpret the slope of the least-squares line in the context of this question. (2 marks)
(e) Predict the average daily sleep time of a child who has just had their eighth birthday.
(2 marks)
DO NOT WRITE IN THIS AREA AS IT WILL BE CUT OFF
(f) A paediatrician looked at the data and said, " as children age, it causes them to need less
sleep". Comment on this statement. (2 marks)
Question 5 (8 marks)
The graph below represents a town
centre, with street corners shown as
vertices, streets as edges and the
length, in metres, of each street as
an edge weight.
(a) List, in order, the vertices that lie on the shortest path from 𝐻 to 𝐶 and state the length of
(b) Does the graph contain an Eulerian trail? Justify your answer. (2 marks)
(c) A cleaning team must make their way along every street in the town centre, starting and
finishing at the same street corner. Determine, if any the adjustments necessary to
achieve this, and the minimum distance the cleaning team must travel. (3 marks)
Question 6 (7 marks)
A complete bipartite graph with 𝑛 vertices in one group and 𝑚 vertices in the other group will
have 𝑛𝑚 edges.
(a) Explain the meaning of the term complete for such a graph. (1 mark)
(b) Draw a complete bipartite graph with 5 edges. The graph should clearly be bipartite with
DO NOT WRITE IN THIS AREA AS IT WILL BE CUT OFF
(c) Construct the adjacency matrix for the graph you drew in part (b). (2 marks)
(d) Determine, with justification, the minimum number of vertices that a complete bipartite
graph with 24 edges can have. (2 marks)
Question 7 (9 marks)
A small animal sanctuary has six buildings spread out over an area of land. There are paved
roads between buildings 1 and 2, 2 and 3, 2 and 5, 3 and 4, 3 and 5, and 5 and 6.
(a) Construct graph 𝐺 to represent this network of buildings and paved roads. (2 marks)
(ii) the shortest, closed walk in graph 𝐺 that visits all six vertices. (1 mark)
(d) A new paved road is planned between two different buildings. With the addition of this
road, graph 𝐺 will be a semi-Hamiltonian graph. Determine the number of possible pairs of
buildings that the road could be built between. Justify your answer. (3 marks)
Supplementary page
SN023-196-1