| Date | May Example question | Marks available | 1 | Reference code | EXM.1.AHL.TZ0.24 |
| Level | Additional Higher Level | Paper | Paper 1 | Time zone | Time zone 0 |
| Command term | Write down | Question number | 24 | Adapted from | N/A |
Question
The above diagram shows the weighted graph G.
Write down the adjacency matrix for G.
[1]
a.i.
Find the number of distinct walks of length 4 beginning and ending at A.
[3]
a.ii.
Starting at A, use Prim’s algorithm to find and draw the minimum spanning tree for G.
Your solution should indicate clearly the way in which the tree is constructed.
[5]
b.
Markscheme
M = A1
[1 mark]
a.i.
We require the (A, A) element of M4 which is 13. M1A2
[3 marks]
a.ii.
A1A1A1A1A1
[5 marks]
b.
Examiners report
[N/A]
a.i.
[N/A]
a.ii.
[N/A]
b.
