Paper Reference(s)

6689/01

Edexcel GCE
Decision Mathematics D1
Advanced/Advanced Subsidiary
Practice Paper B
Time: 1 hour 30 minutes

Materials required for examination

Nil

Items included with question papers

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 formulas 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, initials
and signature.

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 8 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 12 pages. Any blank pages are
indicated.

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 not gain credit.

Printers Log. No.

N33563A

*N33563A*

W850/R6689/57570 2/2/
This publication may be reproduced only in accordance with Edexcel Limited copyright policy. 2007 Edexcel Limited.

Turn over

Write your answers in the D1 answer book for this paper.

1.

Define the terms

(a) bipartite graph,
(2)
(b) alternating path,
(2)
(c) matching,
(1)
(d) complete matching.
(1)
(Total 6 marks)

N33563A

2.
A

1a

1a

1b

1b

Figure 1

Figure 2

Six workers, Annie, Emma, Hannah, Jerry, Louis and Morand, are to be assigned to five tasks, 1,
2, 3, 4 and 5.
For safety reasons, task 1 must be done by two people working together.
A bipartite graph showing the possible allocations of the workers is given in Figure 1 and an initial
matching is given in Figure 2.
The maximum matching algorithm will be used to obtain a complete matching.
(a) Although there are five tasks, six vertices have been created on the right hand side of each
bipartite graph. Explain why this is necessary when applying this algorithm.
(2)
(b) Find an alternating path and the complete matching it gives.
(3)
Hannah is now unable to do task 5 due to health reasons.
(c) Explain why a complete matching is no longer possible.
(2)
(Total 7 marks)

N33563A

Turn over

3.
0.8

0.9
0.7
F

0.2

1.5
B

0.8

1.1
C

1.3

0.7

0.9
D
Figure 3

An engineer needs to check the state of a number of roads to see whether they need resurfacing.
The roads that need to be checked are represented by the arcs in Fig. 3. The number on each arc
represents the length of that road in km. To check all the roads, he needs to travel along each road
at least once. He wishes to minimise the total distance travelled.
The engineers office is at G, so he starts and ends his journey at G.
(a) Use an appropriate algorithm to find a route for the engineer to follow. State your route and its
length.
(6)
The engineer lives at D. He believes he can reduce the distance travelled by starting from home and
inspecting all the roads on the way to his office at G.
(b) State whether the engineer is correct in his belief. If so, calculate how much shorter his new
route is. If not, explain why not.
(3)
(Total 9 marks)

N33563A

4.

The precedence table shows the activities involved in a project.

Activity

Immediately preceding activities

C, D

F, H

G, J

(a) Draw the activity network for this project, using activity on arc and using two dummies.
(4)
(b) Explain why each of the two dummies is necessary.
(3)
(Total 7 marks)

N33563A

Turn over

5.

55

80

25

84

25

34

17

75

(a) The list of numbers above is to be sorted into descending order. Perform a bubble sort to obtain
the sorted list, giving the state of the list after each complete pass.
(5)
The numbers in the list represent weights, in grams, of objects which are to be packed into bins that
hold up to 100 g.
(b) Determine the least number of bins needed.
(2)
(c) Use the first-fit decreasing algorithm to fit the objects into bins which hold up to 100 g.
(3)
(Total 10 marks)

N33563A

6.

(a) Explain what is meant by the term path.

(2)
B

27

11

28

23

G
37

56

15

21
20
39

21

D
44
F
44

20

27
83

Figure 4
Figure 4 shows a network of cycle tracks. The number on each edge represents the length, in miles,
of that track. Mary wishes to cycle from A to I as part of a cycling holiday. She wishes to minimise
the distance she travels.
(b) Use Dijkstras algorithm to find the shortest path from A to I. Show all necessary working in
the boxes in Diagram 1 in the answer book. State your shortest path and its length.
(6)
(c) Explain how you determined the shortest path from your labelling.
(2)
Mary wants to visit a theme park at E.
(d) Find a path of minimal length that goes from A to I via E and state its length.
(2)
(Total 10 marks)

N33563A

Turn over

7.

(a) Define the terms

(i) tree,
(ii) spanning tree,
(iii) minimum spanning tree.
(3)
(b) State one difference between Kruskals algorithm and Prims algorithm, to find a minimum
spanning tree.
(1)
H

8
9
14

12

10

N
15

14

11

10

13
C

F
Figure 5
(c) Use Kruskals algorithm to find the minimum spanning tree for the network shown in Fig. 5.
State the order in which you included the arcs. Draw the minimum spanning tree in Diagram
2 in the answer book and state its length.
(4)

N33563A

80

120

90

140

50

70

100

N
150

140
100

130

60

110

C
F
Figure 6
Figure 6 models a car park. Currently there are two pay-stations, one at E and one at N. These two
are linked by a cable as shown. New pay-stations are to be installed at B, H, A, F and C. The number
on each arc represents the distance between the pay-stations in metres. All of the pay-stations need
to be connected by cables, either directly or indirectly. The current cable between E and N must be
included in the final network. The minimum amount of new cable is to be used.
(d) Using your answer to part (c), or otherwise, determine the minimum amount of new cable
needed. Use Diagram 3 to show where these cables should be installed. State the minimum
amount of new cable needed.
(3)
(Total 11 marks)

N33563A

Turn over

8.

A company produces two types of self-assembly wooden bedroom suites, the Oxford and the
York. After the pieces of wood have been cut and finished, all the materials have to be packaged.
The table below shows the time, in hours, needed to complete each stage of the process and the
profit made, in pounds, on each type of suite.
Oxford
4
3.5
2
300

Cutting
Finishing
Packaging
Profit ()

York
6
4
4
500

The times available each week for cutting, finishing and packaging are 66, 56 and 40 hours
respectively.
The company wishes to maximise its profit.
Let x be the number of Oxford, and y be the number of York suites made each week.
(a) Write down the objective function.
(1)
(b) In addition to
2x + 3y - 33,
x . 0,
y . 0,
find two further inequalities to model the companys situation.
(2)
(c) On the grid in the answer booklet, illustrate all the inequalities, indicating clearly the feasible
region.
(4)
(d) Explain how you would locate the optimal point.
(2)
(e) Determine the number of Oxford and York suites that should be made each week and the
maximum profit gained.
(3)
It is noticed that when the optimal solution is adopted, the time needed for one of the three stages
of the process is less than that available.
(f) Identify this stage and state by how many hours the time may be reduced.
(3)
(Total 15 marks)
TOTAL FOR PAPER: 75 MARKS
END
N33563A

10

BLANK PAGE

N33563A

11

Turn over

BLANK PAGE

N33563A

12