Loading subjects
Networks · Part 4 of 5
3 exam-style questions with model answers, plus 4 quick multi-choice questions — every question on this part of the standard, grouped by the 1 page of notes they come from.
Write a full answer before you reveal the model one. That comparison is where the learning happens.
A network has degrees: P = 2, Q = 4, R = 3, S = 3, T = 2. State whether it is traversable, and where any journey must start and finish.
A rubbish truck must drive along every street in a suburb. The street network has nodes with degrees: depot D = 4, W = 3, X = 5, Y = 4, Z = 2, V = 2. Explain whether the round can be done without repeating a street, and advise the council.
A gritting network has six intersections with degrees 3, 3, 3, 3, 4 and 4, and every road is 2 km long. Determine the minimum distance the gritter must drive to cover every road, starting and finishing at the depot, which is one of the degree-4 intersections. Justify that no shorter journey exists.