D1 June 2013 Q1

EdexcelOld spec7 marksAllocation

1.

Figure 1: possible allocations of A, B, H, I, L, R to tasks 1 to 6
Figure 1
Figure 2: initial matching A–1, H–3, L–4, R–5
Figure 2

Figure 1 shows the possible allocations of six people, Alex (A), Ben (B), Harriet (H), Izzy (I), Leo (L) and Rowan (R), to six tasks, 1, 2, 3, 4, 5 and 6.

(a) Write down the technical name given to the type of diagram shown in Figure 1. (1)

Figure 2 shows an initial matching.

(b) Starting from the given initial matching, use the maximum matching algorithm to find a complete matching. You should list the alternating paths you use, and state your improved matching after each iteration. (6)
‹ Previous31 of 59 in AllocationNext ›