0% found this document useful (0 votes)

1K views32 pages

wdm11 01 Que 20230602

This document provides instructions and questions for a mathematics exam. It includes: 1) Instructions for how to complete the exam, including only using black or dark blue ink, filling out identifying information, and showing working. 2) Four multi-part questions related to activity networks, sorting algorithms, a repeating algorithm, and linear programming. The questions involve tasks like completing tables, determining optimal solutions, and finding coordinate points. 3) Information that the exam is 1.5 hours with a total of 75 marks and the marks for each question are in parentheses.

Uploaded by

Jonathan Jeevaratnam

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)

1K views32 pages

wdm11 01 Que 20230602

Uploaded by

Jonathan Jeevaratnam

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

Introduction
Question 1
Question 2
Question 3
Question 4
Question 5
Question 6
Question 7
Question 8

Pearson Edexcel International Advanced Level

Friday 2 June 2023

Afternoon (Time: 1 hour 30 minutes)
Paper
reference WDM11/01
Mathematics
 

International Advanced Subsidiary/Advanced Level

Decision Mathematics D1

You must have:

Decision Mathematics Answer Book (enclosed), calculator

Candidates may use any calculator allowed by Pearson regulations. 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.
• IfColoured pencils
pencil is used for diagrams/sketches/graphs it must be dark (HB or B).
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.
• Do not return the question paper with the answer book.
• clearly labelled.
Answer all questions and ensure that your answers to parts of questions are

• Answer the questions in the D1 answer book provided

– there may be more space than you need.
• You should show sufficient working to make your methods clear. Answers without
working may not gain full credit.
• Inexact answers should be given to three significant figures unless otherwise stated.
Information
• There are 8 questions in this question paper. The total mark for this paper is 75.
• The 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.
• Ifandyouanychange your mind about an answer, cross it out and put your new answer
working underneath.
Turn over

P74307A
©2023 Pearson Education Ltd.
N:1/1/1/1/
*P74307A*
Write your answers in the D1 answer book for this paper.
1.

E(5) I(2)

A(5) F(6) N(3)

D(4)
B(7)
J(7) K(5) P(6)

G(2)
C(6) Q(5)
L(4)

H(4) M(8)

Figure 1

A project is modelled by the activity network shown in Figure 1. The activities are
represented by the arcs. The number in brackets on each arc gives the time, in days,
to complete the activity. Each activity requires exactly one worker. The project is to be
completed in the shortest possible time.
(a) Complete Diagram 1 in the answer book to show the early event times and the late
event times.
(4)
(b) Calculate the maximum number of days by which activity H could be delayed
without lengthening the completion time of the project. You must make the numbers
used in your calculation clear.
(1)
(c) Calculate a lower bound for the number of workers needed to complete the project
in the minimum time. You must show your working.
(2)
(d) Schedule the activities on Grid 1 in the answer book, using the minimum number of
workers, so that the project is completed in the minimum time.
(3)
(Total for Question 1 is 10 marks)

2 P74307A

2. A list of eleven numbers is to be sorted into descending order.
After one pass, the quick sort algorithm produces the following list

17 33 14 25 23 28 21 13 9 6 10

(a) State, with a reason, which number was used as a pivot for the first pass.
(1)
(b) Starting at the left-hand end of the above list, obtain the fully sorted list using a
bubble sort. You need to write down only the list that results at the end of each pass.
(3)
(c) Apply the first-fit decreasing bin packing algorithm to the fully sorted list to pack
the numbers into bins of size 85
(2)
(Total for Question 2 is 6 marks)

P74307A 3
 Turn over
3. In this question, the function INT(X ) is the largest integer less than or equal to X.
For example,

INT(5.7) = 5

INT(8) = 8

INT(–2.3) = –3
Consider the following algorithm.
Step 1 Input N
Step 2 Calculate A = N ÷ 10
Step 3 Let B = INT(A)
Step 4 Calculate C = B × 10
Step 5 Calculate D = N – C
Step 6 Output D
Step 7 Replace N by B
Step 8 If N = 0 then STOP, otherwise go back to Step 2
(a) Complete the table in the answer book, using N = 4217, to show the results obtained
at each step of the algorithm.
(4)
(b) Explain how the output values of the algorithm relate to the original input N,
where N is any positive integer.
(2)
(Total for Question 3 is 6 marks)

4 P74307A

4.
y
y = 2x
14

10
R

3x + y = 30

0
0 2 4 6 8 10 12 x

Figure 2
Figure 2 shows the constraints of a linear programming problem in x and y, where R is
the feasible region. The equations of two of the lines are shown on the graph.
(a) Determine the inequalities that define the feasible region.
(3)
(b) Find the exact coordinates of the vertices of the feasible region.
(3)
The objective is to maximise P, where P = 2x + ky
(c) For the case k = 3, use the point testing method to find the optimal vertex of the
feasible region and state the corresponding value of P.
(3)
(d) Determine the range of values for k for which the optimal vertex found in (c) is
still optimal.
(2)
(Total for Question 4 is 11 marks)

P74307A 5
 Turn over
5.
Activity Immediately preceding activities

A -

B -

C -

D A

E A

F B, C, E

G B, C, E

H C

I C

J D, F, G, H, I

K D, F, G, H, I

L I

(a) Draw the activity network described in the precedence table above, using activity on
arc and the minimum number of dummies.
(5)
A project is modelled by the activity network drawn in (a). Each activity requires
exactly one worker. The project is to be completed in the shortest possible time.
The table below gives the time, in hours, to complete three of the activities.

Activity Duration (in hours)

A 10

E 7

F 8

The length of the critical path AEFK is 33 hours.

(b) Determine the range of possible values for the duration of activity J. You must make
your method and working clear.
(2)
(Total for Question 5 is 7 marks)

6 P74307A

6.
6
B 27 E 33
J

11 29 5 40
12

25 C 10
A 23
F
8
13 22 15

D 34 G 2 H

Figure 3

[The total weight of the network is 315]

Figure 3 represents a network of roads between nine parks, A, B, C, D, E, F, G, H and J.
The number on each edge represents the length, in miles, of the corresponding road.
(a) (i) Use Dijkstra’s algorithm to find the shortest path from A to J.
(ii) State the length of the shortest path from A to J.
(6)
The roads between the parks need to be inspected. Robin must travel along each road at
least once. Robin wishes to minimise the length of the inspection route. Robin will start
the inspection route at C and finish at E.
(b) By considering the pairings of all relevant nodes, find the length of Robin’s route.
(4)
(c) State the number of times Robin will pass through G.
(1)
It is now decided to start and finish the inspection route at A. Robin must still minimise
the length of the route and travel along each road at least once.
(d) Calculate the difference between the lengths of the two inspection routes.
(1)
(e) State the edges that need to be traversed twice in the route that starts and finishes at
A, but do not need to be traversed twice in the route that starts at C and finishes
at E.
(1)
(Total for Question 6 is 13 marks)

P74307A 7
 Turn over
7.

A B C D E F G H
A – 38 37 x 37 42 41 27
B 38 – 26 32 33 38 37 34
C 37 26 – 39 38 39 30 39
D x 32 39 – 37 36 29 36
E 37 33 38 37 – 32 33 30
F 42 38 39 36 32 – 31 28
G 41 37 30 29 33 31 – 33
H 27 34 39 36 30 28 33 –

The network represented by the table shows the least distances, in km, between eight
museums, A, B, C, D, E, F, G and H.
A tourist wants to visit each museum at least once, starting and finishing at A. The
tourist wishes to minimise the total distance travelled. The shortest distance between A
and D is x km where 32  x  35
(a) Using Prim’s algorithm, starting at A, obtain a minimum spanning tree for the
network. You must clearly state the order in which you select the arcs of your tree.
(3)
(b) Use your answer to (a) to determine an initial upper bound for the length of the
tourist’s route.
(1)
(c) Starting at A, use the nearest neighbour algorithm to find another upper bound for
the length of the tourist’s route. Write down the route that gives this upper bound.
(2)
The nearest neighbour algorithm starting at E gives a route of

E–H–A–D–G–C–B–F–E

(d) State which of these two nearest neighbour routes gives the better upper bound.
Give reasons for your answer.
(2)
Starting by deleting A, and all of its arcs, a lower bound of 235 km for the length of the
route is found.
(e) Determine the smallest interval that must contain the optimal length of the tourist’s
route. You must make your method and working clear.
(4)
(Total for Question 7 is 12 marks)

8 P74307A

8. A headteacher is deciding how to allocate prizes to the students who are leaving at the
end of the school year.
There are three categories of prize: academic, sport, and leadership.
• Each academic prize costs £14, each sport prize costs £8, and each leadership prize
costs £12. The total amount available to spend on all prizes is £976
• For every 5 academic prizes there must be at least 2 leadership prizes
• At least half the prizes must be academic
• 20% of the prizes must be for sport
The headteacher wishes to maximise the total number of prizes.
Let x, y and z represent the number of academic, sport and leadership
prizes respectively.
(a) Formulate this as a linear programming problem in x and y only, stating
the objective and listing the constraints as simplified inequalities with
integer coefficients.
(8)
Given that the headteacher awards 16 sport prizes,
(b) calculate the corresponding number of leadership prizes that the headteacher awards.
You must show your working.
(2)
(Total for Question 8 is 10 marks)

TOTAL FOR PAPER: 75 MARKS

END

P74307A 9

BLANK PAGE

10 P74307A

BLANK PAGE

P74307A 11

BLANK PAGE

12 P74307A

Please check the examination details below before entering your candidate information
Candidate surname Other names

Centre Number Candidate Number

Pearson Edexcel International Advanced Level

Friday 2 June 2023
Afternoon (Time: 1 hour 30 minutes) Paper
reference WDM11/01
Mathematics
 

International Advanced Subsidiary/Advanced Level

Decision Mathematics D1

Answer Book Total Marks

Do not return the question paper with the answer book.

Turn over

P74307A
©2023 Pearson Education Ltd.
N:1/1/1/1/
*P74307A0120*
1.
Key:
E(5) I(2)

DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
Early

DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
event
time
Late
event
A(5) F(6) N(3) time
D(4)

B(7)
J(7) K(5) P(6)

G(2)
C(6) Q(5)
L(4)

H(4) M(8)

Diagram 1

2
*P74307A0220* 
Question 1 continued
_____________________________________________________________________________________
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

0 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36

Grid 1
(Total for Question 1 is 10 marks)

3
 *P74307A0320* Turn over
2. 17 33 14 25 23 28 21 13 9 6 10
_____________________________________________________________________________________

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
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________

4
*P74307A0420* 
Question 2 continued
_____________________________________________________________________________________
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 Question 2 is 6 marks)

5
 *P74307A0520* Turn over
3. 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 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
N A B C D

Outputs: ______________________________________________________________________________

6
*P74307A0620* 
Question 3 continued
_____________________________________________________________________________________
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

7
 *P74307A0720* Turn over
4.
_____________________________________________________________________________________

8
*P74307A0820* 
Question 4 continued
_____________________________________________________________________________________
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

9
 *P74307A0920* Turn over
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


*P74307A01020*
10
5.
Question 5 continued
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

11
 *P74307A01120* Turn over
6.

12
6
B 27 E 33 J

11 29
5 40
12

A 25 C 10 F
23

8
22
13
15

D G H
34 2

Key:

*P74307A01220*
Order of Final
Vertex
labelling value

Working values

Shortest path: _________________________________________________________________________

Length of shortest path:_________________________________________________________________


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
Question 6 continued
_____________________________________________________________________________________
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

13
 *P74307A01320* Turn over
Question 6 continued
_____________________________________________________________________________________

14
*P74307A01420* 
7.
DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA

A B C D E F G H
DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA

A – 38 37 x 37 42 41 27
B 38 – 26 32 33 38 37 34
C 37 26 – 39 38 39 30 39
D x 32 39 – 37 36 29 36
E 37 33 38 37 – 32 33 30
F 42 38 39 36 32 – 31 28
G 41 37 30 29 33 31 – 33
H 27 34 39 36 30 28 33 –

15
 *P74307A01520* Turn over
Question 7 continued

DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
A B C D E F G H

DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
A – 38 37 x 37 42 41 27
B 38 – 26 32 33 38 37 34
C 37 26 – 39 38 39 30 39
D x 32 39 – 37 36 29 36
E 37 33 38 37 – 32 33 30
F 42 38 39 36 32 – 31 28
G 41 37 30 29 33 31 – 33
H 27 34 39 36 30 28 33 –

16
*P74307A01620* 
Question 7 continued
DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA

A B C D E F G H
DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA

17
 *P74307A01720* Turn over
8.
_____________________________________________________________________________________

18
*P74307A01820* 
Question 8 continued
_____________________________________________________________________________________
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

19
 *P74307A01920* Turn over
Question 8 continued
_____________________________________________________________________________________

DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
(Total for Question 8 is 10 marks)

TOTAL FOR PAPER: 75 MARKS

END

20
*P74307A02020* 

Turn over
*P74307A*
P74307A
©2023 Pearson Education Ltd.
N:1/1/1/1/


Pearson Edexcel International Advanced Level
Frid

2
P74307A


Write your answers in the D1 answer book for this paper.
1.
A(5)
B(7)
C(6)
D(4)
E(5)
F(6)
G(2)
H(4)
I(2)
J



3
Turn over
P74307A
2. A list of eleven numbers is to be sorted into descending order.

After one pass, the

4
P74307A


3. In this question, the function INT(X) is the largest integer less than or equal to X.

For example,



5
Turn over
P74307A
4.
y
12
10
8
6
4
2
0
14
12
10
8
6
4
2
0
R
x
y = 2x
3x + y = 30
Figure 2

Figure 2 shows t

6
P74307A


5.
Activity
Immediately preceding activities
A
-
B
-
C
-
D
A
E
A
F
B, C, E
G
B, C, E
H
C
I
C
J
D, F, G, H



7
Turn over
P74307A
6.
A
B
C
D
E
F
G
H
J
11
25
13
8
12
27
29
10
22
34
15
5
40
23
2
6
33
Figure 3
[The total wei

8
P74307A


7.
A
B
C
D
E
F
G
H
A
–
38
37
x
37
42
41
27
B
38
–
26
32
33
38
37
34
C
37
26
–
39
38
39
30
39
D
x
32
39
–
3



9
P74307A
8. A headteacher is deciding how to allocate prizes to the students who are leaving at the
end of the sc

Mathematics: Thursday 15 May 2025
No ratings yet
Mathematics: Thursday 15 May 2025
32 pages
1H 2024 Edexcel Predicted Paper HKM
No ratings yet
1H 2024 Edexcel Predicted Paper HKM
16 pages
4MA1 1H Que 20220111
No ratings yet
4MA1 1H Que 20220111
28 pages
2024 Edexcel IGCSE Maths Predicted Paper 2HR
No ratings yet
2024 Edexcel IGCSE Maths Predicted Paper 2HR
36 pages
P3 Revision Questions (Trigonometry)
No ratings yet
P3 Revision Questions (Trigonometry)
22 pages
4ma1 2h Que 20240604
No ratings yet
4ma1 2h Que 20240604
28 pages
2H 2024 Edexcel Predicted Paper HKM 2
No ratings yet
2H 2024 Edexcel Predicted Paper HKM 2
16 pages
June 2019 (IAL) QP - S1 Edexcel
No ratings yet
June 2019 (IAL) QP - S1 Edexcel
24 pages
MathsWithDan Edexcel GCSE Maths Predicted Paper 1 May 2025 Foundation
No ratings yet
MathsWithDan Edexcel GCSE Maths Predicted Paper 1 May 2025 Foundation
23 pages
4MA1 2H Question Paper Working
No ratings yet
4MA1 2H Question Paper Working
27 pages
Eyad Hard Questions
100% (1)
Eyad Hard Questions
119 pages
01a Extended Maths Certificate Specimen Papers Set 1 Paper 1 PDF
No ratings yet
01a Extended Maths Certificate Specimen Papers Set 1 Paper 1 PDF
16 pages
Jan 2023 1hr Maths Exam Paper
No ratings yet
Jan 2023 1hr Maths Exam Paper
28 pages
October 2024 IAL QP S2 Edexcel
No ratings yet
October 2024 IAL QP S2 Edexcel
28 pages
IB Questionbank Mathematics Higher Level 3rd Edition 1
No ratings yet
IB Questionbank Mathematics Higher Level 3rd Edition 1
16 pages
QQQ P1 Chapter13 v1
No ratings yet
QQQ P1 Chapter13 v1
3 pages
1ma1 3h Que 20220614
No ratings yet
1ma1 3h Que 20220614
24 pages
Edexcel 2024 Practice Paper 3 Higher
No ratings yet
Edexcel 2024 Practice Paper 3 Higher
18 pages
(Booklet) KS4 Mastery Higher 1 - Answers - Single Pages
No ratings yet
(Booklet) KS4 Mastery Higher 1 - Answers - Single Pages
36 pages
Year 11 Igsce Extended Math Paper 41 June 2010 Solutions 1295520081 Phpapp01
50% (4)
Year 11 Igsce Extended Math Paper 41 June 2010 Solutions 1295520081 Phpapp01
35 pages
AEA Mathematics Exam Paper 2019
No ratings yet
AEA Mathematics Exam Paper 2019
28 pages
Factorising Quadratics ( 1) : (Level 5)
No ratings yet
Factorising Quadratics ( 1) : (Level 5)
5 pages
Test 19
No ratings yet
Test 19
25 pages
Trigonometry Exercises and Analysis
No ratings yet
Trigonometry Exercises and Analysis
5 pages
2016 Senior ISMTF Individual Vienna
No ratings yet
2016 Senior ISMTF Individual Vienna
12 pages
Stuvia 6196540 2024 Edexcel Gcse Combined Science Higher Physics Paper 2 Paper 6 Mark Scheme
No ratings yet
Stuvia 6196540 2024 Edexcel Gcse Combined Science Higher Physics Paper 2 Paper 6 Mark Scheme
23 pages
A-Level Maths Exam Prep
No ratings yet
A-Level Maths Exam Prep
20 pages
Edexcel GCE Pure Mathematics P1 Exam Paper
No ratings yet
Edexcel GCE Pure Mathematics P1 Exam Paper
6 pages
Entrance Examination: Procedures and Sample Questions
No ratings yet
Entrance Examination: Procedures and Sample Questions
9 pages
2210 WST01-01 IAL Statistics P1 October 2022 PDF
No ratings yet
2210 WST01-01 IAL Statistics P1 October 2022 PDF
28 pages
AS & A Level Math Mock Exam
No ratings yet
AS & A Level Math Mock Exam
15 pages
Integral Topic Assessment 1 2
No ratings yet
Integral Topic Assessment 1 2
1 page
IAS Pure Mathematics P1 Specimen Paper
No ratings yet
IAS Pure Mathematics P1 Specimen Paper
24 pages
Ilovepdf Merged
100% (1)
Ilovepdf Merged
593 pages
Edexcel A Level Mathematics Pure Mathematics Year 1 PDF Trigonometric Functions Derivative
No ratings yet
Edexcel A Level Mathematics Pure Mathematics Year 1 PDF Trigonometric Functions Derivative
1 page
4MA1 Specimen Papers - Paper 2H
0% (1)
4MA1 Specimen Papers - Paper 2H
24 pages
3-Representation of Data
No ratings yet
3-Representation of Data
12 pages
01a 1MA1 1H Spring 2024 Aiming For Grade 9 PDF
No ratings yet
01a 1MA1 1H Spring 2024 Aiming For Grade 9 PDF
9 pages
1h Sample Assessment
No ratings yet
1h Sample Assessment
26 pages
CA Guess Paper of Phy 9702
No ratings yet
CA Guess Paper of Phy 9702
31 pages
AQA Level 2 FM 8365 Practice Paper 2
No ratings yet
AQA Level 2 FM 8365 Practice Paper 2
22 pages
June 2017 QP - Paper 1F Edexcel Maths (A) IGCSE
0% (1)
June 2017 QP - Paper 1F Edexcel Maths (A) IGCSE
24 pages
Mathematics: Tuesday 9 May 2023
No ratings yet
Mathematics: Tuesday 9 May 2023
17 pages
Phy 2025
No ratings yet
Phy 2025
148 pages
AQA As Physics November 2021 Paper 1 MS
No ratings yet
AQA As Physics November 2021 Paper 1 MS
28 pages
Wma13 01 Que 20240531
No ratings yet
Wma13 01 Que 20240531
32 pages
AS - A Level Further Mathematics Baseline Test
No ratings yet
AS - A Level Further Mathematics Baseline Test
3 pages
The Sine and Cosine Rule Answers
No ratings yet
The Sine and Cosine Rule Answers
25 pages
June 2019 (IAL) QP - Unit 1 Edexcel Physics A-Level
No ratings yet
June 2019 (IAL) QP - Unit 1 Edexcel Physics A-Level
28 pages
Math IA Assessment Guidance for Teachers
100% (1)
Math IA Assessment Guidance for Teachers
30 pages
Bangla IGCSE MarkScheme
No ratings yet
Bangla IGCSE MarkScheme
16 pages
May 2023 IGCSE Math Edexcel 4MA1
No ratings yet
May 2023 IGCSE Math Edexcel 4MA1
24 pages
05a 1MA1 2H November 2023 Examination Paper PDF
No ratings yet
05a 1MA1 2H November 2023 Examination Paper PDF
20 pages
A Level Further Mathematics For AQA Mechanics Student Book (ASA Level) (Jess Barker, Nathan Barker, Michele Conway Etc.) (Z-Library)
No ratings yet
A Level Further Mathematics For AQA Mechanics Student Book (ASA Level) (Jess Barker, Nathan Barker, Michele Conway Etc.) (Z-Library)
518 pages
2001 Jun - P1qp
No ratings yet
2001 Jun - P1qp
6 pages
Fermat Contest: Canadian Mathematics Competition
No ratings yet
Fermat Contest: Canadian Mathematics Competition
5 pages
June 2023 QP 2
No ratings yet
June 2023 QP 2
32 pages
wdm11 01 Que 20230602
No ratings yet
wdm11 01 Que 20230602
32 pages
D1 May 2024
No ratings yet
D1 May 2024
12 pages
@CryptoCred - Market Structure
100% (1)
@CryptoCred - Market Structure
40 pages
ICT Exam Instructions
No ratings yet
ICT Exam Instructions
24 pages
4CM1 02 Que 20210511
No ratings yet
4CM1 02 Que 20210511
20 pages
HTML & CSS Basics and Features
No ratings yet
HTML & CSS Basics and Features
7 pages
wst02 01 Que 20230523
No ratings yet
wst02 01 Que 20230523
24 pages
JavaScript DOM Functions Explained
No ratings yet
JavaScript DOM Functions Explained
9 pages
CSS Syntax: Cascading Style Sheet (CSS)
No ratings yet
CSS Syntax: Cascading Style Sheet (CSS)
10 pages
Understanding Kruskal's Algorithm
No ratings yet
Understanding Kruskal's Algorithm
7 pages
Understanding Parabolas: Equations & Graphs
No ratings yet
Understanding Parabolas: Equations & Graphs
23 pages
Plant Layout (Hospital) (Operations Management)
No ratings yet
Plant Layout (Hospital) (Operations Management)
86 pages
Decentralized Control of Complex Systems
No ratings yet
Decentralized Control of Complex Systems
12 pages
Lec - 30 Final
No ratings yet
Lec - 30 Final
38 pages
Sparse Matrix and Linked List Operations
No ratings yet
Sparse Matrix and Linked List Operations
35 pages
A Study On Power-3 Heronian Odd Mean Labeling For Some Path Related Graphs
No ratings yet
A Study On Power-3 Heronian Odd Mean Labeling For Some Path Related Graphs
6 pages
Wa0034.
No ratings yet
Wa0034.
12 pages
Foundation of Data Science - Concept Notes
No ratings yet
Foundation of Data Science - Concept Notes
202 pages
Frequency Distribution and Graph Types
No ratings yet
Frequency Distribution and Graph Types
28 pages
19级 2021秋算法分析与设计 A 霍红卫
No ratings yet
19级 2021秋算法分析与设计 A 霍红卫
8 pages
Maximum Flow - Augmenting Path Algorithms Comparison
No ratings yet
Maximum Flow - Augmenting Path Algorithms Comparison
20 pages
CSE Lesson Plan: Graph Theory CS6702
No ratings yet
CSE Lesson Plan: Graph Theory CS6702
2 pages
Algorithm and Complexity Question Bank
No ratings yet
Algorithm and Complexity Question Bank
33 pages
DAA Question Bank
No ratings yet
DAA Question Bank
4 pages
Part One - Diff - Solve One Inequality Worksheet
No ratings yet
Part One - Diff - Solve One Inequality Worksheet
3 pages
Slot: A2 Set: A SRM Institute of Science and Technology College of Engineering and Technology Department of Mathematics
No ratings yet
Slot: A2 Set: A SRM Institute of Science and Technology College of Engineering and Technology Department of Mathematics
6 pages
Discrete Math Exam Questions
No ratings yet
Discrete Math Exam Questions
6 pages
Mathematics in The Modern World-Module 6
100% (1)
Mathematics in The Modern World-Module 6
74 pages
A2 Unit 5 Review
No ratings yet
A2 Unit 5 Review
2 pages
B.SC Maths (2014-15) - 1
No ratings yet
B.SC Maths (2014-15) - 1
20 pages
Understanding NP-Completeness and Reductions
No ratings yet
Understanding NP-Completeness and Reductions
22 pages
2.4 Note Taking Guide
No ratings yet
2.4 Note Taking Guide
2 pages
Dijkstra's Algorithm Explained
No ratings yet
Dijkstra's Algorithm Explained
6 pages
Graph Theory for Mathematicians
No ratings yet
Graph Theory for Mathematicians
9 pages
Asia-Pacific Informatics Olympiad 2009 Solutions
No ratings yet
Asia-Pacific Informatics Olympiad 2009 Solutions
5 pages
Corrective Assignment: 8.1 Definite Integral NAME: - DATE
No ratings yet
Corrective Assignment: 8.1 Definite Integral NAME: - DATE
2 pages
BFS, DFS, and Best First Search Overview
No ratings yet
BFS, DFS, and Best First Search Overview
15 pages
Computer Science Quiz Questions
No ratings yet
Computer Science Quiz Questions
3 pages
Centrality Measures PDF
No ratings yet
Centrality Measures PDF
10 pages

wdm11 01 Que 20230602

Uploaded by

wdm11 01 Que 20230602

Uploaded by

Pearson Edexcel International Advanced Level

Friday 2 June 2023

International Advanced Subsidiary/Advanced Level

You must have:

Candidates may use any calculator allowed by Pearson regulations. Calculators

• Answer the questions in the D1 answer book provided

A(5) F(6) N(3)

Activity Duration (in hours)

The length of the critical path AEFK is 33 hours.

[The total weight of the network is 315]

TOTAL FOR PAPER: 75 MARKS

Centre Number Candidate Number

Pearson Edexcel International Advanced Level

International Advanced Subsidiary/Advanced Level

Answer Book Total Marks

Shortest path: _________________________________________________________________________

Length of shortest path:_________________________________________________________________

TOTAL FOR PAPER: 75 MARKS

You might also like