Paper Reference(s)

6689/01
Edexcel GCE
Decision Mathematics D1
Advanced/Advanced Subsidiary
Friday 11 January 2008 – Morning
Time: 1 hour 30 minutes
Materials required for examination Items included with question papers
Nil D1 Answer book

Candidates may use any calculator allowed by the regulations of the Joint
Council for Qualifications. Calculators must not have the facility for
symbolic algebra manipulation, differentiation and integration, or have
retrievable mathematical formulae stored in them.

Instructions to Candidates
Write your answers for this paper in the D1 answer book provided.
In the boxes on the answer book, write your centre number, candidate number, your surname,
initial(s) and signature.
When a calculator is used, the answer should be given to an appropriate degree of accuracy.
Complete your answers in blue or black ink or pencil.
Do not return the question paper with the answer book.

Information for Candidates

Full marks may be obtained for answers to ALL questions.
The marks for individual questions and the parts of questions are shown in round brackets: e.g. (2).
There are 7 questions in this question paper. The total mark for this paper is 75.
There are 12 pages in this question paper. The answer book has 16 pages. Any blank pages are
indicated.

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

Printer’s Log. No.

N29279A Turn over

*N29279A*
W850/R6689/57570 3/3/3/3/3

This publication may be reproduced only in accordance with Edexcel Limited copyright policy. ©2008 Edexcel Limited.
 Write your answers in the D1 answer book for this paper.

1. (a) Define the terms

(i) alternating path,

(2)

(ii) matching.
(2)

A 1 A 1

B 2 B 2

C 3 C 3

D 4 D 4

E 5 E 5

Figure 1 Figure 2

At a school fair, five teachers, A, B, C, D and E, are to supervise five stalls, 1, 2, 3, 4 and 5.

A bipartite graph showing their possible allocations is given in Figure 1. An initial matching is
given in Figure 2.

(b) Use the maximum matching algorithm twice to obtain a complete matching.
List clearly the alternating paths you use.
(5)

(Total 9 marks)

N29279A 2
2. (a)

18 20 11 7 17 15 14 21 23 16 9

The list of numbers shown above is to be sorted into ascending order. Apply quick sort to
obtain the sorted list. You must make your pivots clear.
(5)

E
21
17
G
B 14
11 9

18 11
7 F I
23 16
A 20 C
H
15
11

Figure 3

Figure 3 represents a network of paths in a park. The number on each arc represents the length of
the path in metres.

(b) Using your answer to part (a) and Kruskal’s algorithm, find a minimum spanning tree for the
network in Figure 3. You should list the arcs in the order in which you consider them and state
whether you are adding it to your minimum spanning tree.
(4)

(c) Find the total weight of the minimum spanning tree.

(1)

(Total 10 marks)

N29279A 3 Turn over

3.
C 0.5 F

1.1
0.5
0.7 0.6
A
0.8 0.9
D
G

1.0 1.4
1.0
1.3

B 1.2
E

Figure 4

Figure 4 models a network of roads in a housing estate. The number on each arc represents the
length, in km, of the road.

The total weight of the network is 11 km.

A council worker needs to travel along each road once to inspect the road surface. He will start and
finish at A and wishes to minimise the length of his route.

(a) Use an appropriate algorithm to find a route for the council worker. You should make your
method and working clear. State your route and its length.
(6)

A postal worker needs to walk along each road twice, once on each side of the road. She must start
and finish at A. The length of her route is to be minimised. You should ignore the width of the
road.

(b) (i) Explain how this differs from the standard route inspection problem.
(1)

(ii) Find the length of the shortest route for the postal worker.
(2)

(Total 9 marks)

N29279A 4
4.

5
D (9) 26
9
H (2) 26

A (5) M (9)
J (6)

17
(17) 20
0 B K (14)
E (3)
0
20
F (6) L (10)
C (8) I (3)
8
23
G (10)
25

Figure 5

A project is modelled by the activity network shown in Figure 5. The activities are represented
by the arcs. The number in brackets on each arc gives the time, in hours, to complete the activity.
Some of the early and late times for each event are shown.

(a) Calculate the missing early and late times and hence complete Diagram 1 in your answer
book.
(4)

(b) Calculate the total float on activities D, G and I. You must make your calculations clear.
(4)

(c) List the critical activities.

(1)

Each activity requires one worker.

(d) Calculate a lower bound for the number of workers needed to complete the project in the
minimum time.
(2)

(Total 11 marks)

N29279A 5 Turn over

5. (a) Draw the activity network described in this precedence table, using activity on arc and exactly
two dummies.
(4)

Activity Immediately preceding activities

A -
B -
C A
D B
E B, C
F B, C

(b) Explain why each of the two dummies is necessary.

(3)

(Total 7 marks)

N29279A 6
6. (a) Define the term ‘cut’ as it applies to a directed network.
(2)

A 33 32 D
35
32
G
32 9 48
32 0 7 39
19
T
C 23 10 E
10
4 0
0 15
S 10 20
7
H
10 3
56 22 15
15
B 21 12 F

Figure 6

Figure 6 shows a capacitated, directed network. The number on each arc represents the capacity of
that arc. The numbers in circles represent an initial flow.

(b) Complete the labelling procedure on Diagram 2 in your answer book by entering values along
CE, EG, HT and GT.
(2)

(c) Find the maximum flow through the network. You must list each flow-augmenting route you
use together with its flow.
(4)

(d) Show a maximal flow pattern on Diagram 3 in your answer book.

(2)

(e) State the value of the maximum flow through the network.
(1)

(f) Prove that your flow is maximal.

(2)

(Total 13 marks)

N29279A 7 Turn over

 7.
y

100

80

60

40

20

x + y =70

20 40 60 80 100 120 140 160 x

Figure 7

N29279A 8
7. Phil sells boxed lunches to travellers at railway stations. Customers can select either the vegetarian
box or the non-vegetarian box.

Phil decides to use graphical linear programming to help him optimise the numbers of each type of
box he should produce each day.

Each day Phil produces x vegetarian boxes and y non-vegetarian boxes.

One of the constraints limiting the number of boxes is

x + y . 70.

This, together with x . 0, y . 0 and a fourth constraint, has been represented in Figure 7. The
rejected region has been shaded.

(a) Write down the inequality represented by the fourth constraint.

(2)

Two further constraints are:

x + 2y - 160

and y > 60.

(b) Add two lines and shading to Diagram 4 in your answer book to represent these inequalities.
(4)

(c) Hence determine and label the feasible region, R.

(1)

(d) Use your graph to determine the minimum total number of boxes he needs to prepare each day.
Make your method clear.
(3)

Phil makes a profit of £1.20 on each vegetarian box and £1.40 on each non-vegetarian box. He
wishes to maximise his profit.

(e) Write down the objective function.

(1)

(f) Use your graph to obtain the optimal number of vegetarian and non-vegetarian boxes he should
produce each day. You must make your method clear.
(4)

(g) Find Phil’s maximum daily profit.

(1)

(Total 16 marks)
TOTAL FOR PAPER: 75 MARKS

END

N29279A 9
 BLANK PAGE

N29279A 10
 BLANK PAGE

N29279A 11
 BLANK PAGE

N29279A 12