0% found this document useful (0 votes)

17 views28 pages

6689 01 Que 20160617

Uploaded by

nleyaeugene5

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

17 views28 pages

6689 01 Que 20160617

Uploaded by

nleyaeugene5

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

You are on page 1/ 28

Pearson Edexcel GCE

Decision Mathematics D1
Advanced/Advanced Subsidiary

Friday 17 June 2016 – Afternoon Paper Reference

Time: 1 hour 30 minutes 6689/01

You must have:
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
•• Use black ink or ball-point pen.
If pencil is used for diagrams/sketches/graphs it must be dark (HB or B).
Coloured pencils and highlighter pens must not be used.
• centre
Fill in the boxes on the top of the answer book with your name,
number and candidate number.
• clearly
Answer all questions and ensure that your answers to parts of questions are
labelled.
• – there may
Answer the questions in the D1 answer book provided
be more space than you need.
• without
You should show sufficient working to make your methods clear. Answers
working may not gain full credit.
• degree of accuracy.is used, the answer should be given to an appropriate
When a calculator

• Do not return the question paper with the answer book.

Information
•• The
The total mark for this paper is 75.
marks for each question are shown in brackets
– use this as a guide as to how much time to spend on each question.
Advice
•• Read each question carefully before you start to answer it.
Try to answer every question.
• Check your answers if you have time at the end.
Turn over
P46678A
©2016 Pearson Education Ltd.

1/1/1/1/e2
*P46678A*
Write your answers in the D1 answer book for this paper.

L A L A

M B M B

N C N C

P D P D

T E T E

Figure 1 Figure 2

(a) Define the term ‘bipartite graph’.

(2)

Figure 1 shows the possible allocations of five people, Larry (L), Monisha (M), Nina (N), Phil (P)
and Theo (T), to five activities, A, B, C, D and E.

Figure 2 shows an initial matching.

(b) Starting from this initial matching, use the maximum matching algorithm to find a complete
matching. You should list the alternating path you use and state your complete matching.
(3)

(Total 5 marks)

P46678A 2
2. Draw the activity network described in the precedence table below, using activity on arc and exactly
three dummies.

Activity Immediately preceding activities

A –
B –
C A
D A
E B
F B
G A, E, F
H F
I C
J D, G
K D, G

(Total 5 marks)

P46678A 3 Turn over

3. 59 45 18 55 47 11 63 17 15 42

(a) The list of numbers above is to be sorted into descending order. Perform a quick sort to obtain
the sorted list. You should show the result of each pass and identify your pivots clearly.
(4)

The numbers in the list represent the lengths, in cm, of some pieces of copper wire. The copper
wire is sold in one metre lengths.

(b) Use the first-fit decreasing bin packing algorithm to determine how these pieces could be cut
from one metre lengths. (You should ignore wastage due to cutting.)
(3)

(Total 9 marks)

P46678A 4
4.
A
5
B
17 13
E
C
21
15 D
13 31
10
F 4 H 7
2 G
9
14 23 17

J 15
K

Figure 3

Figure 3 represents a network of tram tracks. The number on each edge represents the length,
in miles, of the corresponding track. One day, Sarah wishes to travel from A to F. She wishes to
minimise the distance she travels.

(a) Use Dijkstra’s algorithm to find the shortest path from A to F. State your path and its length.
(6)

On another day, Sarah wishes to travel from A to F via J.

(b) Find a route of minimal length that goes from A to F via J and state its length.
(2)

(c) Use Prim’s algorithm, starting at G, to find the minimum spanning tree for the network.
You must clearly state the order in which you select the edges of your tree.
(3)

(d) State the length, in miles, of the minimum spanning tree.

(1)

(Total 12 marks)

P46678A 5 Turn over

Start

Input x and y

t=0

x=x–1
Yes
Is x odd? y=y
x t=t+y
x=
2
y = 2y
No
t=t

No Yes
Is x = 0? Output t Stop

Figure 4

An algorithm is described by the flow chart shown in Figure 4.

Given that x = 27 and y = 5,

(a) complete the table in the answer book to show the results obtained at each step when the
algorithm is applied. Give the final output.
(4)
1
The numbers 122 and are to be used as inputs for the algorithm described by the flow chart.
2
(b) (i) State, giving a reason, which number should be input as x.

(ii) State the output.

(3)

(Total 7 marks)

P46678A 6
6.
B 15 C 24 K 22 L

17 42 31 11
40
9
A E 17
23 D 5 F

12 68 18

G 18 H 12 J

Figure 5

[The total weight of the network is 384]

Figure 5 models a network of corridors in an office complex that need to be inspected by a security
guard. The number on each arc is the length, in metres, of the corresponding section of corridor.

Each corridor must be traversed at least once and the length of the inspection route must be
minimised. The guard must start and finish at vertex A.

(a) Use the route inspection algorithm to find the length of the shortest inspection route. State the
arcs that should be repeated. You should make your method and working clear.
(5)

It is now possible for the guard to start at one vertex and finish at a different vertex. An inspection
route that traverses each corridor at least once is still required.

(b) Explain why the inspection route should start at a vertex with odd degree.
(2)

The guard decides to start the inspection route at F and the length of the inspection route must still
be minimised.

(d) State a possible route and its length.

(2)

(Total 11 marks)

P46678A 7 Turn over

5 D(w) 17 K(13) 30

5 17 30
A(5) E(4) G(7) L(5)

M(6) 30
0 B(7) 9 H(8) 17
30
0 9 y

F (5) I(12)
C(3) N(8)

3 x

z J(10) 22

Figure 6

The network in Figure 6 shows the activities that need to be undertaken by a company to complete
a project. Each activity is represented by an arc and the duration, in days, is shown in brackets.
Each activity requires exactly one worker. The early event times and late event times are shown at
each vertex.

Given that the total float on activity D is 1 day,

(a) find the values of w, x, y and z.

(3)

(b) On Diagram 1 in the answer book, draw a cascade (Gantt) chart for the project.
(4)

(c) Use your cascade chart to determine a lower bound for the minimum number of workers
needed to complete the project in the shortest possible time. You must make specific reference
to times and activities.
(2)

It is decided that the company may use up to 36 days to complete the project.

(d) On Diagram 2 in the answer book, construct a scheduling diagram to show how the project can
be completed within 36 days using as few workers as possible.
(3)

(Total 12 marks)

P46678A 8
8. Charlie needs to buy storage containers.

There are two different types of storage container available, standard and deluxe.

Standard containers cost £20 and deluxe containers cost £65. Let x be the number of standard
containers and y be the number of deluxe containers.

The maximum budget available is £520

(a) Write down an inequality, in terms of x and y, to model this constraint.

(1)

Three further constraints are:

x.2
–x + 24y . 24
7x + 8y - 112

(b) Add lines and shading to Diagram 1 in the answer book to represent all four constraints.
Hence determine the feasible region and label it R.
(4)

The capacity of a deluxe container is 50% greater than the capacity of a standard container.
Charlie wishes to maximise the total capacity.

(c) State an objective function, in terms of x and y.

(1)

(d) Use the objective line method to find the optimal vertex, V, of the feasible region. You must
make your objective line clear and label the optimal vertex V.
(3)

(e) Calculate the exact coordinates of vertex V.

(2)

(f) Determine the number of each type of container that Charlie should buy. You must make your
method clear and calculate the cost of purchasing the storage containers.
(3)

(Total 14 marks)
TOTAL FOR PAPER: 75 MARKS

END

P46678A 9
BLANK PAGE

P46678A 10
BLANK PAGE

P46678A 11
BLANK PAGE

P46678A 12
Write your name here
Surname Other names

Centre Number Candidate Number

Pearson
Edexcel GCE
Decision Mathematics D1
Advanced/Advanced Subsidiary

Friday 17 June 2016 – Afternoon Paper Reference

Time: 1 hour 30 minutes 6689/01

Answer Book Total Marks
Do not return the question paper with the answer book.

Turn over

P46678A
©2016 Pearson Education Ltd.
*P46678A0116*
1/1/1/1/e2
Leave
blank
1.
L A L A

DO NOT WRITE IN THIS AREA

M B M B

N C N C

P D P D

T E T E

Figure 1 Figure 2

DO NOT WRITE IN THIS AREA

_______________________________________________________________________
_______________________________________________________________________
_______________________________________________________________________
_______________________________________________________________________
_______________________________________________________________________
_______________________________________________________________________
_______________________________________________________________________
_______________________________________________________________________
_______________________________________________________________________
_______________________________________________________________________
_______________________________________________________________________
_______________________________________________________________________ DO NOT WRITE IN THIS AREA

(Total 5 marks)

2
*P46678A0216*
DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA

*P46678A0316*
(Total 5 marks)
Q2

3
blank
Leave

Turn over
Leave
blank
3. 59 45 18 55 47 11 63 17 15 42
_______________________________________________________________________

DO NOT WRITE IN THIS AREA

4
*P46678A0416*
Leave
blank
Question 3 continued
_______________________________________________________________________
DO NOT WRITE IN THIS AREA

(Total 9 marks)

5
*P46678A0516* Turn over
Leave
blank
4.
A

DO NOT WRITE IN THIS AREA

5
B
13
17 E

C 21
15
D 7
31
13
10
F H
2 4
G

9
14 17

DO NOT WRITE IN THIS AREA

23
J
15
K

Key:

Order of Final
Vertex
labelling value

Working values

Shortest path: . .............................................................. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

DO NOT WRITE IN THIS AREA

Length of shortest path: ........................................ . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

6
*P46678A0616*
Leave
blank
Question 4 continued
_______________________________________________________________________
DO NOT WRITE IN THIS AREA

(Total 12 marks)

7
*P46678A0716* Turn over
Leave
blank
5. (a) You may not need to use all the rows in this table.
It may not be necessary to complete all boxes in each row.

DO NOT WRITE IN THIS AREA

x y t Is x odd? Is x = 0?

27 5 0 Yes

DO NOT WRITE IN THIS AREA

8
*P46678A0816*
Leave
blank
Question 5 continued
DO NOT WRITE IN THIS AREA
DO NOT WRITE IN THIS AREA

Final output _____________________________________________________________

(b)
_______________________________________________________________________
_______________________________________________________________________
_______________________________________________________________________
_______________________________________________________________________
_______________________________________________________________________
_______________________________________________________________________
_______________________________________________________________________
_______________________________________________________________________
DO NOT WRITE IN THIS AREA

(Total 7 marks)

9
*P46678A0916* Turn over
Leave
blank
6.
B 15 C 24 K 22 L

DO NOT WRITE IN THIS AREA

17 42 31 11
40
9
A E 17
23 D 5 F

12 68 18

G 18 H 12 J

Figure 5
[The total weight of the network is 384]
_______________________________________________________________________

DO NOT WRITE IN THIS AREA

10
*P46678A01016*
Leave
blank
Question 6 continued
_______________________________________________________________________
DO NOT WRITE IN THIS AREA

(Total 11 marks)

11
*P46678A01116* Turn over
Leave
blank
7. (a) ___________________________________________________________________
___________________________________________________________________

DO NOT WRITE IN THIS AREA

Diagram 1

12
*P46678A01216*
Leave
blank
Question 7 continued
(c) ___________________________________________________________________
DO NOT WRITE IN THIS AREA

(d)

0 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38
DO NOT WRITE IN THIS AREA
DO NOT WRITE IN THIS AREA

Diagram 2
Q7

(Total 12 marks)

13
*P46678A01316* Turn over
Leave
blank
8.
y
16 –

DO NOT WRITE IN THIS AREA

14 –

12 –

10 –

8–

DO NOT WRITE IN THIS AREA

6–

4–

2–

0– x
–

0 4 8 12 16 20 24 28 32

Diagram 1

_______________________________________________________________________
DO NOT WRITE IN THIS AREA

14
*P46678A01416*
Leave
blank
Question 8 continued
_______________________________________________________________________
DO NOT WRITE IN THIS AREA

15
*P46678A01516* Turn over
Leave
blank
Question 8 continued
_______________________________________________________________________

DO NOT WRITE IN THIS AREA

(Total 14 marks)

TOTAL FOR PAPER: 75 MARKS

END

16
*P46678A01616*

June 2017 QP D1
No ratings yet
June 2017 QP D1
32 pages
Edexcel GCE: Decision Mathematics D1 Advanced/Advanced Subsidiary
No ratings yet
Edexcel GCE: Decision Mathematics D1 Advanced/Advanced Subsidiary
32 pages
Edexcel GCE: Decision Mathematics D1 Advanced/Advanced Subsidiary
No ratings yet
Edexcel GCE: Decision Mathematics D1 Advanced/Advanced Subsidiary
12 pages
Ilovepdf Merged
No ratings yet
Ilovepdf Merged
131 pages
D1 January 2012 Question Paper
No ratings yet
D1 January 2012 Question Paper
32 pages
6689 01 Que 20080111
No ratings yet
6689 01 Que 20080111
24 pages
Decision Mathematics D1 Jan 2016 Question Paper
No ratings yet
Decision Mathematics D1 Jan 2016 Question Paper
24 pages
1906 D1 - June 2019 PDF
No ratings yet
1906 D1 - June 2019 PDF
32 pages
Jan 2021 Decision 1 Ial Maths Edexcel QP
No ratings yet
Jan 2021 Decision 1 Ial Maths Edexcel QP
32 pages
WDM01 01 Que 20190621
No ratings yet
WDM01 01 Que 20190621
28 pages
D1 Jan 2010
No ratings yet
D1 Jan 2010
24 pages
D1 May 2024
No ratings yet
D1 May 2024
12 pages
Thursday 2020: Further Mathematics
No ratings yet
Thursday 2020: Further Mathematics
20 pages
WDM11 01 Que 20211020
No ratings yet
WDM11 01 Que 20211020
32 pages
Oct 2020 Decision 1 Ial Maths Edexcel QP
No ratings yet
Oct 2020 Decision 1 Ial Maths Edexcel QP
32 pages
2012 May D1 PDF
No ratings yet
2012 May D1 PDF
28 pages
January 2021 QP
No ratings yet
January 2021 QP
32 pages
WDM01 01 Que 20150120 PDF
No ratings yet
WDM01 01 Que 20150120 PDF
28 pages
Old Spec D1
No ratings yet
Old Spec D1
158 pages
Oct 20 IAL QP
No ratings yet
Oct 20 IAL QP
32 pages
Decision Mathematics 1 Exam Guide
No ratings yet
Decision Mathematics 1 Exam Guide
18 pages
Ilovepdf Merged
No ratings yet
Ilovepdf Merged
360 pages
WDM01 01 Que 20201015
No ratings yet
WDM01 01 Que 20201015
32 pages
WDM11 01 Que 20210304
No ratings yet
WDM11 01 Que 20210304
32 pages
Edexcel数学qp 202401 Math d1
No ratings yet
Edexcel数学qp 202401 Math d1
28 pages
D1 2019 and Answer Booklet
No ratings yet
D1 2019 and Answer Booklet
32 pages
WDM01 01 Que 20180118
No ratings yet
WDM01 01 Que 20180118
32 pages
9fm0 3d Que 20240622
No ratings yet
9fm0 3d Que 20240622
36 pages
June 2024 A Level D1 Paper
No ratings yet
June 2024 A Level D1 Paper
16 pages
9FM0-3D AL Decision 1 Papers (All To 2024)
No ratings yet
9FM0-3D AL Decision 1 Papers (All To 2024)
178 pages
Mathematics: Thursday 15 May 2025
No ratings yet
Mathematics: Thursday 15 May 2025
32 pages
downloadMathsA LevelPapersEdexcel FurtherDecision 1QPJune20201920QP PDF
No ratings yet
downloadMathsA LevelPapersEdexcel FurtherDecision 1QPJune20201920QP PDF
32 pages
wdm11 01 Que 20230602
No ratings yet
wdm11 01 Que 20230602
32 pages
WDM11 01 Que 20200305
No ratings yet
WDM11 01 Que 20200305
28 pages
9FM0-3D AL Decision 1 Practice Paper 3 (Word)
No ratings yet
9FM0-3D AL Decision 1 Practice Paper 3 (Word)
20 pages
2306 8FM0 27 AS Decision Mathematics 1 - June 2023 PDF
No ratings yet
2306 8FM0 27 AS Decision Mathematics 1 - June 2023 PDF
8 pages
WDM11 01 Que 20211020 PDF
No ratings yet
WDM11 01 Que 20211020 PDF
32 pages
June 2019 QP 2
No ratings yet
June 2019 QP 2
32 pages
WDM11 01 Que 20201015 PDF
No ratings yet
WDM11 01 Que 20201015 PDF
32 pages
8FM0-27 AS Decision Mathematics 1 - May 2018
No ratings yet
8FM0-27 AS Decision Mathematics 1 - May 2018
8 pages
June 2022 QP
No ratings yet
June 2022 QP
20 pages
縮,D1
No ratings yet
縮,D1
308 pages
October 2021 QP
No ratings yet
October 2021 QP
32 pages
Decision Mathematics Exam Instructions
No ratings yet
Decision Mathematics Exam Instructions
36 pages
June 2023 QP 7
No ratings yet
June 2023 QP 7
20 pages
9FM0-3D AL Decision 1 Practice Paper 4 (Word)
No ratings yet
9FM0-3D AL Decision 1 Practice Paper 4 (Word)
20 pages
June 2022 QP - DM1 Edexcel Further Maths As-Level
No ratings yet
June 2022 QP - DM1 Edexcel Further Maths As-Level
8 pages
9FM0-3D AL Decision 1 Practice Paper 5 (Word)
No ratings yet
9FM0-3D AL Decision 1 Practice Paper 5 (Word)
22 pages
1376 - 33 D1 June 2007
No ratings yet
1376 - 33 D1 June 2007
11 pages
D1 Specimen
No ratings yet
D1 Specimen
28 pages
8FM0 27 Que 20211008
0% (1)
8FM0 27 Que 20211008
20 pages
8fm0 27 Que 20240518
No ratings yet
8fm0 27 Que 20240518
20 pages
January 2020 QP
No ratings yet
January 2020 QP
28 pages
Edexcel GCE: Decision Mathematics D1 Advanced/Advanced Subsidiary
No ratings yet
Edexcel GCE: Decision Mathematics D1 Advanced/Advanced Subsidiary
24 pages
2406 8FM0-27 AS Decision Mathematics 1 - June 2024 PDF
0% (1)
2406 8FM0-27 AS Decision Mathematics 1 - June 2024 PDF
8 pages
wdm11 01 Que 20230602
No ratings yet
wdm11 01 Que 20230602
32 pages
WDM11 Jan25 QP
No ratings yet
WDM11 Jan25 QP
32 pages
MODULE 5 Discrete Distribution
No ratings yet
MODULE 5 Discrete Distribution
16 pages
DA Lab Manual
No ratings yet
DA Lab Manual
60 pages
Online Credit Card Fraud Detection Using Big Data: A Project Review On
No ratings yet
Online Credit Card Fraud Detection Using Big Data: A Project Review On
16 pages
Leetcode 75 Questions (NeetCode On Yt)
No ratings yet
Leetcode 75 Questions (NeetCode On Yt)
8 pages
Medicinal Plant Classification Using Particle Swarm Optimized Cascaded Network
No ratings yet
Medicinal Plant Classification Using Particle Swarm Optimized Cascaded Network
14 pages
13.3 Floating Point Numbers Notes 2024
No ratings yet
13.3 Floating Point Numbers Notes 2024
8 pages
Statistical Modelling Syllabus
No ratings yet
Statistical Modelling Syllabus
10 pages
IB Maths SL Probability Guide
No ratings yet
IB Maths SL Probability Guide
44 pages
Business Analytics Course Outline
No ratings yet
Business Analytics Course Outline
10 pages
Set 1
No ratings yet
Set 1
2 pages
SCM 08 - Periodic Inventory Managament
No ratings yet
SCM 08 - Periodic Inventory Managament
25 pages
Unit 1 Introduction To Neural Networks
No ratings yet
Unit 1 Introduction To Neural Networks
9 pages
Quantum Computing For Finance
No ratings yet
Quantum Computing For Finance
16 pages
Chapter 7 - Entropy Control Volume - Partial
No ratings yet
Chapter 7 - Entropy Control Volume - Partial
30 pages
Correlation & Regression
No ratings yet
Correlation & Regression
3 pages
AI BOOK - NOTES (In The Form of A PPT)
100% (1)
AI BOOK - NOTES (In The Form of A PPT)
38 pages
Assessment of Maintenance Effectiveness For Repairable Systems PM and CM Case Studies
No ratings yet
Assessment of Maintenance Effectiveness For Repairable Systems PM and CM Case Studies
5 pages
2024.01.20-27 QRM1 - C2 PDF Final
No ratings yet
2024.01.20-27 QRM1 - C2 PDF Final
40 pages
Machine Learning - Exploring The Model
50% (2)
Machine Learning - Exploring The Model
3 pages
Cryptography in NET Succinctly
100% (1)
Cryptography in NET Succinctly
67 pages
Lesson 4 Gradient Descent
No ratings yet
Lesson 4 Gradient Descent
13 pages
Mercity - Ai-Guide To Fine-Tuning LLMs Using PEFT and LoRa Techniques
No ratings yet
Mercity - Ai-Guide To Fine-Tuning LLMs Using PEFT and LoRa Techniques
25 pages
Quantitative Analysis 3
No ratings yet
Quantitative Analysis 3
22 pages
1.1 Module-1
No ratings yet
1.1 Module-1
31 pages
Pe It801b
No ratings yet
Pe It801b
5 pages
Linear Functions
No ratings yet
Linear Functions
6 pages
NLP Script
No ratings yet
NLP Script
2 pages
MAT102 Scheme 2024
No ratings yet
MAT102 Scheme 2024
5 pages
Doom AI
No ratings yet
Doom AI
7 pages
Course Outline
No ratings yet
Course Outline
2 pages

6689 01 Que 20160617

Uploaded by

6689 01 Que 20160617

Uploaded by

Pearson Edexcel GCE

Friday 17 June 2016 – Afternoon Paper Reference

Time: 1 hour 30 minutes 6689/01

Candidates may use any calculator allowed by the regulations of the

• Do not return the question paper with the answer book.

(a) Define the term ‘bipartite graph’.

Figure 2 shows an initial matching.

Activity Immediately preceding activities

P46678A 3 Turn over

On another day, Sarah wishes to travel from A to F via J.

(d) State the length, in miles, of the minimum spanning tree.

P46678A 5 Turn over

An algorithm is described by the flow chart shown in Figure 4.

Given that x = 27 and y = 5,

(ii) State the output.

[The total weight of the network is 384]

(d) State a possible route and its length.

P46678A 7 Turn over

Given that the total float on activity D is 1 day,

(a) find the values of w, x, y and z.

The maximum budget available is £520

(a) Write down an inequality, in terms of x and y, to model this constraint.

Three further constraints are:

(c) State an objective function, in terms of x and y.

(e) Calculate the exact coordinates of vertex V.

Centre Number Candidate Number

Friday 17 June 2016 – Afternoon Paper Reference

Time: 1 hour 30 minutes 6689/01

DO NOT WRITE IN THIS AREA

DO NOT WRITE IN THIS AREA

DO NOT WRITE IN THIS AREA

DO NOT WRITE IN THIS AREA

DO NOT WRITE IN THIS AREA

DO NOT WRITE IN THIS AREA

Length of shortest path: ........................................ . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

DO NOT WRITE IN THIS AREA

DO NOT WRITE IN THIS AREA

Final output _____________________________________________________________

DO NOT WRITE IN THIS AREA

DO NOT WRITE IN THIS AREA

DO NOT WRITE IN THIS AREA

DO NOT WRITE IN THIS AREA

DO NOT WRITE IN THIS AREA

DO NOT WRITE IN THIS AREA

DO NOT WRITE IN THIS AREA

DO NOT WRITE IN THIS AREA

TOTAL FOR PAPER: 75 MARKS

You might also like