D1 January 2012 Q2
2.

[The weight of the network is 129 miles]
Figure 2 models a network of canals. The number on each arc gives the length, in miles, of that canal.
Brett needs to travel along each canal to check that it is in good repair. He wishes to minimise the length of his route.
A canal between B and F, of length 12 miles, is to be opened and needs to be included in Brett’s inspection route.
| Scheme | Marks |
|---|---|
| BD + EF = 10 + 17 = 27 | M1 A1 |
| BE + DF = 15 + 10 = 25 \(\leftarrow\) | A1 |
| BF + DE = 20 + 14 = 34 | A1 |
| Repeat arcs BC, CE and DF | A1ft |
| Length of route = 129 + 25 = 154 | B1ft |
| (6) |
Notes
a1M1: Three pairings of their four odd nodes
a1A1: One row correct including pairing and total
a2A1: Two rows correct including pairing and total
a3A1: Three rows correct including pairing and total
a4A1ft: Their smallest repeated arcs, (accept BCE).
a1B1ft: 129 + their least out of a choice of at least two possible, distinct, pairings.
| Scheme | Marks |
|---|---|
| We add BF(12) to the network so only have to repeat DE (14) Length of route is therefore 129 + 12 + 14 = 155 | M1 |
| 155>154 so his route would be increased | A1 |
| (2) | |
| (8 marks) |
Notes
b1M1: DE identified, using/repeating 12 + their DE [ft from (a)]
b1A1: CAO, conclusion, numerical argument e.g. ref to 155 or 26 etc.