Paper Reference(s)

6689
Edexcel GCE
Decision Mathematics D1
(New Syllabus)
Advanced/Advanced Subsidiary
Friday 18 January 2002  Afternoon
Time: 1 hour 30 minutes
Materials required for examination Items included with question papers
Graph Paper (ASG2) Answer booklet

Candidates may use any calculator EXCEPT those with the facility for symbolic
algebra, differentiation and/or integration. Thus candidates may NOT use calculators
such as the Texas Instruments TI 89, TI 92, Casio CFX 9970G, Hewlett Packard HP
48G

Q6 the question paper version has been used,

amended to ‘R2 can accept 27 van loads’

Instructions to Candidates
In the boxes on the answer book, write your centre number, candidate number, your surname,
initials and signature.

Information for Candidates

Full marks may be obtained for answers to ALL questions.
This paper has seven questions.

Advice to Candidates
You must ensure that your answers to parts of questions are clearly labelled.
You must show sufficient working to make your methods clear to the Examiner. Answers
without working may gain no credit.

N9132 W850/R6689/57570 3/3/3/3/3/3/3/3/3/3700

This publication may only be reproduced in accordance with Edexcel copyright policy.
Edexcel Foundation is a registered charity. ©2002 Edexcel
1. Ann, Bryn, Daljit, Gareth and Nickos have all joined a new committee. Each of
them is to be allocated to one of five jobs 1, 2, 3, 4 or 5. The table shows each
member’s preferences for the jobs.

Ann 1 or 2
Bryn 3 or 1
Daljit 2 or 4
Gareth 5 or 3
Nickos 1 or 2

Initially Ann, Bryn, Daljit and Gareth are allocated the first job in their lists
shown in the table.

(a) Draw a bipartite graph to model the preferences shown in the table and
indicate, in a distinctive way, the initial allocation of jobs.
(2)
(b) Use the matching improvement algorithm to find a complete matching,
showing clearly your alternating path.
(3)
(c) Find a second alternating path from the initial allocation.
(1)

2. (i) Use the binary search algorithm to try to locate the name SABINE in the
following alphabetical list. Explain each step of the algorithm.

1. ABLE
2. BROWN
3. COOKE
4. DANIEL
5. DOUBLE
6. FEW
7. OSBORNE
8. PAUL
9. SWIFT
10. TURNER
(5)
(ii) Find the maximum number of iterations of the binary search algorithm
needed to locate a name in a list of 1000 names.
(2)

N9132 2
3. (i)
A B C D E F
A  10 12 13 20 9
B 10  7 15 11 7
C 12 7  11 18 3
D 13 15 11  27 8
E 20 11 18 27  18
F 9 7 3 8 18 

The table shows the distances, in metres, between six nodes A, B, C, D, E, and F
of a network.

(a) Use Prim’s algorithm, starting at A, to solve the minimum connector problem
for this table of distances. Explain your method and indicate the order in which
you selected the edges.
(4)
(b) Draw your minimum spanning tree and find its total length.
(2)
(c) State whether your minimum spanning tree is unique. Justify your answer.
(1)
(ii) A connected network N has seven vertices.

(a) State the number of edges in a minimum spanning tree for N.

(1)
A minimum spanning tree for a connected network has n edges.

(b) State the number of vertices in the network.

(1)

N9132 3
4. Figure 1
A B C D
   
4 6 6

1 2 8 4

E F G
 H
4 5 2

5 7 3 1

   
I 2 J 4 K 1 L

Figure 1 shows a network of roads. Erica wishes to travel from A to L as quickly

as possible. The number on each edge gives the time, in minutes, to travel along
that road.

(a) Use Dijkstra’s algorithm to find a quickest route from A to L. Complete all the
boxes on the answer sheet and explain clearly how you determined the quickest
route from your labelling.
(7)

(b) Show that there is another route which also takes the minimum time
(1)

N9132 4
5. Two fertilizers are available, a liquid X and a powder Y. A bottle of X contains 5
units of chemical A, 2 units of chemical B and 12 unit of chemical C. A packet of
Y contains 1 unit of A, 2 units of B and 2 units of C. A professional gardener
makes her own fertilizer. She requires at least 10 units of A, at least 12 units of B
and at least 6 units of C.

She buys x bottles of X and y packets of Y.

(a) Write down the inequalities which model this situation.

(4)
(b) On the grid provided construct and label the feasible region.
(3)
A bottle of X costs £2 and a packet of Y costs £3.

(c) Write down an expression, in terms of x and y, for the total cost £T.
(1)
(d) Using your graph, obtain the values of x and y that give the minimum value
of T. Make your method clear and calculate the minimum value of T.
(4)
(e) Suggest how the situation might be changed so that it could no longer be
represented graphically.
(2)

N9132 5
6. Figure 2
8 A
W1   6
 R1
6
10
9
12 B
W2  
 R2
3 5

18
W3  
11 C

A company has 3 warehouses W1, W2, and W3. It needs to transport the goods
stored there to 2 retail outlets R1 and R2. The capacities of the possible routes, in
van loads per day, are shown in Fig 2. Warehouses W1, W2 and W3 have 14, 12
and 14 van loads respectively available per day and retail outlets R1 and R2 can
accept 6 and 27 van loads respectively per day.

(a) On Diagram 1 on the answer sheet add a supersource W, a supersink R and the
appropriate directed arcs to obtain a single-source, single-sink capacitated
network. State the minimum capacity of each arc you have added.
(3)
(b) State the maximum flow along

(i) W W1 A R1 R, (ii) W W3 C R2 R.
(2)
(c) Taking your answers to part (b) as the initial flow pattern, use the labelling
procedure to obtain a maximum flow through the network from W to R. Show
your working on Diagram 2. List each flow-augmenting route you use, together
with its flow.
(5)
(d) From your final flow pattern, determine the number of van loads passing
through B each day.
(1)
The company has the opportunity to increase the number of vans loads from one
of the warehouses W1, W2, W3, to A, B or C.

(e) Determine how the company should use this opportunity so that it achieves a
maximal flow.
(3)

N9132 6
7. Figure 3

F(6)
4 5

C(7) H(3)
D(2) E(7)

1 A(5) 2 B(4) 3 6
G(8)
A project is modelled by the activity network shown in Fig 3. The activities are
represented by the edges. The number in brackets on each edge gives the time, in
days, taken to complete the activity.

(a) Calculate the early time and the late time for each event. Write these in the
boxes on the answer sheet.
(4)
(b) Hence determine the critical activities and the length of the critical path.
(2)
(c) Obtain the total float for each of the non-critical activities.
(3)
(d) On the first grid on the answer sheet, draw a cascade (Gantt) chart showing
the information obtained in parts (b) and (c).
(4)
Each activity requires one worker. Only two workers are available.

(e) On the second grid on the answer sheet, draw up a schedule and find the
minimum time in which the 2 workers can complete the project.
(4)

END

N9132 7