Networks, Paths and Trees

We estimate MS11-NP is worth about 4 marks out of 100 under the new Mathematics Standard 2 syllabus. Practise 7 exam-style questions (multi-part, multiple choice) with instant marking and a worked solution for every question.

START PRACTISING

Example questions

Example 1 · 1 mark · multiple choice

Which statement about a spanning tree of a connected network with $n$ vertices is true?

AIt always has the largest total weight
BIt has $n$ edges and contains one cycle
CIt connects all $n$ vertices and has $n - 1$ edges
DIt connects only some of the vertices

Example 2 · 1 mark · multiple choice

In a network, vertex V has edges to vertices W, X and Y, and a loop from V back to itself. What is the degree of V?

Example 3 · 5 marks · multi-part

A network of walking tracks joins six campsites A to F. The table lists every track and its length in kilometres.

Edge	A–B	A–C	B–C	B–D	C–D	C–E	D–E	D–F	E–F
Weight	7	4	2	5	8	6	3	4	9

Answers and worked solutions appear when you practise these questions.

Networks, Paths and Trees

Example questions

Other Mathematics Standard 2 topics