Questions - Edexcel D1 - A-Level Maths

Each academic prize costs $\pounds 14$, each sport prize costs $\pounds 8$, and each leadership prize costs $\pounds 12$. The total amount available to spend on all prizes is $\pounds 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.

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. Given that the headteacher awards 16 sport prizes,
calculate the corresponding number of leadership prizes that the headteacher awards. You must show your working.

Edexcel D1 2024 June Q1

Use the first-fit bin packing algorithm to determine how the eleven numbers listed above can be packed into bins of size 14
The list of numbers is to be sorted into ascending order. Use a quick sort to obtain the sorted list. You should show the result of each pass and identify your pivots clearly.
Apply the first-fit decreasing bin packing algorithm to the sorted list to pack the numbers into bins of size 14
Explain why the number of bins used in part (c) is optimal.
Use the binary search algorithm to try to locate 3.0 in the list of numbers. Clearly indicate how you choose your pivots and which part of the list is rejected at each stage.

Edexcel D1 2024 June Q2

2. \begin{figure}[h]

\includegraphics[alt={},max width=\textwidth]{ba9337bf-7a3c-49aa-b395-dd7818cf1d13-03_942_1587_242_239} \captionsetup{labelformat=empty} \caption{Figure 1}

\end{figure} [The sum of the durations of all the activities is 59 days.]
The network in Figure 1 shows the activities that need to be undertaken to complete a project. Each activity is represented by an arc and the duration, in days, of the corresponding activity is shown in brackets. Each activity requires one worker. The project is to be completed in the shortest possible time.

1. Complete Diagram 1 in the answer book to show the early event times and the late event times.
2. State the minimum completion time of the project.
Calculate a lower bound for the number of workers needed to complete the project in the minimum time. You must show your working.
Schedule the activities using the minimum number of workers so that the project is completed in the minimum time.

Edexcel D1 2024 June Q3

3. \begin{figure}[h]

\includegraphics[alt={},max width=\textwidth]{ba9337bf-7a3c-49aa-b395-dd7818cf1d13-04_994_1616_242_223} \captionsetup{labelformat=empty} \caption{Figure 2}

\end{figure} Figure 2 models a network of tracks between nine ranger stations, A, B, C, D, E, F, G, H and J, in a forest. The number on each edge gives the time, in minutes, to travel along the corresponding track. The forest ranger wishes to travel from A to J as quickly as possible.

Use Dijkstra's algorithm to find the shortest time needed to travel from A to J. State the quickest route.
(6)
Hence determine the weight of the minimum spanning tree for the network given in Figure 2. Give a reason for your answer. You do not need to find the minimum spanning tree.

Edexcel D1 2024 June Q4

4. \begin{figure}[h]

\includegraphics[alt={},max width=\textwidth]{ba9337bf-7a3c-49aa-b395-dd7818cf1d13-06_873_1620_242_223} \captionsetup{labelformat=empty} \caption{Figure 3}

\end{figure} [The total weight of the network is 494]
Direct roads between nine factories, A, B, C, D, E, F, G, H and J, are represented in Figure 3. The number on each arc represents the lengths, in kilometres, of the corresponding road.
The table below shows the shortest distances, in kilometres, between the nine factories.

	A	B	C	D	E	F	G	H	J
A	-	15	7	25	15	42	64	51	46
B	15	-	22	40	30	57	49	36	31
C	7	22	-	32	22	49	71	58	53
D	25	40	32	-	10	17	57	70	71
E	15	30	22	10	-	27	67	66	61
F	42	57	49	17	27	-	40	53	72
G	64	49	71	57	67	40	-	13	32
H	51	36	58	70	66	53	13	-	19
J	46	31	53	71	61	72	32	19	-

\section*{Table of shortest distances}

Starting at A, use Prim's algorithm to find a minimum spanning tree for the table of shortest distances. You must state the order in which you select the arcs of your tree.
(3)
State the weight of the minimum spanning tree.
(1) A route is needed that minimises the total distance to traverse each road at least once. The route must start at E and finish at F .
Determine the length of this route. You must give a reason for your answer. It is now decided to start the route at C and finish the route at A . The route must include every road at least once and must still minimise the total distance travelled.
By considering the pairings of all relevant nodes, find the roads that need to be traversed twice. Naoko needs to visit all nine factories, starting and finishing at the same factory, and wishes to minimise the total distance travelled.
Starting at B, use the nearest neighbour algorithm on the table of shortest distances to find an upper bound for the length of Naoko's route. Write down the cycle, obtained from the table of shortest distances, which gives this upper bound.
By deleting C and all of its arcs, use the values in the table of shortest distances to find a lower bound for the length of Naoko's route.

Edexcel D1 2024 June Q5

5. The head of a Mathematics department needs to order three types of paper. The three types of paper are plain, lined and graph. All three types of paper are sold in reams. (A ream is 500 sheets of paper.)
Based on the last academic year the head of department formed the following constraints.

At least half the paper must be lined
No more than $15 \%$ of the paper must be graph paper
The ratio of plain paper to graph paper must be $5 : 2$

The cost of each ream of plain, lined and graph paper is $\pounds 5 , \pounds 12$ and $\pounds 15$ respectively. The head of department has at most $\pounds 834$ to spend on paper. The head of department wants to maximise the total number of reams of paper ordered.
Let $x , y$ and $z$ represent the number of reams of plain paper, lined paper and graph paper ordered respectively.

Formulate this information as a linear programming problem in $x$ and $y$ only, stating the objective and listing the constraints as simplified inequalities with integer coefficients. The head of department decides to order exactly 42 reams of lined paper and still wishes to maximise the total number of reams of paper ordered.
Determine
1. the total number of reams of paper to be ordered,
2. the number of reams of graph paper to be ordered.

Edexcel D1 2024 June Q6

Activity	Immediately preceding activities
A	-
B	-
C	A
D	-
E	A, B, D
F	D
G	A, B, D
H	F, G
I	A
J	F, G
K	C, E, H, I
L	I
M	C, E, H, I

Draw the activity network for the project described in the precedence table, using activity on arc and the minimum number of dummies. \begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{ba9337bf-7a3c-49aa-b395-dd7818cf1d13-10_880_1154_1464_452} \captionsetup{labelformat=empty} \caption{Grid 1}
\end{figure} A cascade chart for all the activities of the project, except activity $\mathbf { L }$, is shown on Grid 1. The time taken to complete each activity is given in hours and each activity requires one worker. The project is to be completed in the minimum time using as few workers as possible.
State the critical activities of the project.
Use the cascade chart to determine the minimum number of workers needed to complete the project in the shortest possible time. You must make specific reference to time and activities. (You do not need to provide a schedule of the activities.) The duration of activity L is $x$ hours. Given that the total float of activity L is at most 7 hours,
determine the range of possible values for $\chi$.

Edexcel D1 2021 October Q1

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

\begin{figure}[h]

\includegraphics[alt={},max width=\textwidth]{d409aaae-811d-4eca-b118-efc927885f97-02_812_1262_427_404} \captionsetup{labelformat=empty} \caption{Figure 1}

\end{figure} Figure 1 represents a network of roads. The number on each arc represents the length, in km, of the corresponding road. Piatrice wishes to travel from A to J.
(b) Use Dijkstra's algorithm to find the shortest path Piatrice could take from A to J. State your path and its length.
(6) Piatrice needs to return from J to A via G.
(c) Find the shortest path Piatrice could take from J to A via G and state its length.

Edexcel D1 2021 October Q2

2. Chris has been asked to design a badge in the shape of a triangle XYZ subject to the following constraints.

Angle $Y$ should be at least three times the size of angle $X$
Angle $Z$ should be at least $50 ^ { \circ }$ larger than angle $X$
Angle $Y$ must be at most $120 ^ { \circ }$

Chris has been asked to maximise the sum of the angles $X$ and $Y$.
Let $x$ be the size of angle $X$ in degrees.
Let $y$ be the size of angle $Y$ in degrees.
Let z be the size of angle $Z$ in degrees.
Formulate this information as a linear programming problem in $x$ and $y$ only. State the objective and list the constraints as simplified inequalities with integer coefficients. You are not required to solve this problem.

Edexcel D1 2021 October Q3

3. The table below represents a complete network that shows the least costs of travelling between eight cities, A, B, C, D, E, F, G and H.

	A	B	C	D	E	F	G	H
A	-	36	38	40	23	39	38	35
B	36	-	35	36	35	34	41	38
C	38	35	-	39	25	32	40	40
D	40	36	39	-	37	37	26	33
E	23	35	25	37	-	42	24	43
F	39	34	32	37	42	-	45	38
G	38	41	40	26	24	45	-	40
H	35	38	40	33	43	38	40	-

Srinjoy must visit each city at least once. He will start and finish at A and wishes to minimise his total cost.

Use Prim's algorithm, starting at A , to find a minimum spanning tree for this network. You must list the arcs that form the tree in the order in which you select them.
State the weight of the minimum spanning tree.
Use your answer to (b) to help you calculate an initial upper bound for the total cost of Srinjoy’s route.
Show that there are two nearest neighbour routes that start from A. You must make the routes and their corresponding costs clear.
State the best upper bound that can be obtained by using your answers to (c) and (d).
Starting by deleting A and all of its arcs, find a lower bound for the total cost of Srinjoy’s route. You must make your method and working clear.
Use your results to write down the smallest interval that must contain the optimal cost of Srinjoy's route.

Edexcel D1 2021 October Q4

4. \begin{figure}[h]

\includegraphics[alt={},max width=\textwidth]{d409aaae-811d-4eca-b118-efc927885f97-06_757_1163_226_459} \captionsetup{labelformat=empty} \caption{Figure 2}

\end{figure} The network in Figure 2 shows the activities that need to be carried out 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 one worker. The early event times and the late event times are shown at each vertex.

Complete the precedence table in the answer book.
(2) A cascade chart for this project is shown on Grid 1.
\includegraphics[max width=\textwidth, alt={}, center]{d409aaae-811d-4eca-b118-efc927885f97-07_885_1358_276_356} \section*{Grid 1}
Use Figure 2 and Grid 1 to find the values of $v , w , x , y$ and $z$. The project is to be completed in the minimum time using as few workers as possible.
Calculate a lower bound for the minimum number of workers required. You must show your working.
On Grid 2 in your answer book, construct a scheduling diagram for this project. Before the project begins it is found that activity F will require an additional 5 hours to complete. The durations of all other activities are unchanged. The project is still to be completed in the shortest possible time using as few workers as possible.
State the new minimum project completion time and state the new critical path.

Edexcel D1 2021 October Q5

5. \begin{figure}[h]

\includegraphics[alt={},max width=\textwidth]{d409aaae-811d-4eca-b118-efc927885f97-08_588_1428_230_322} \captionsetup{labelformat=empty} \caption{Figure 3}

\end{figure} [The total weight of the network is 166] Figure 3 models a network of cycle lanes that must be inspected. The number on each arc represents the length, in km, of the corresponding cycle lane. Lance needs to cycle along each lane at least once and wishes to minimise the length of his inspection route. He must start and finish at A.

Use an appropriate algorithm to find the length of the route. State the cycle lanes that Lance will need to traverse twice. You should make your method and working clear.
(6)
State the number of times that vertex C appears in Lance's route.
(1) It is now decided that the inspection route may finish at any vertex. Lance will still start at A and must cycle along each lane at least once.
Determine the finishing point so that the length of the route is minimised. You must give reasons for your answer and state the length of this new minimum route.
(3)

Edexcel D1 2021 October Q6

6. A linear programming problem in $x$ and $y$ is described as follows. Maximise $P = k x + y$, where $k$ is a constant
subject to: $\quad 3 y \geqslant x$ $$\begin{aligned} x + 2 y & \leqslant 130
4 x + y & \geqslant 100
4 x + 3 y & \leqslant 300 \end{aligned}$$

Add lines and shading to Diagram 1 in the answer book to represent these constraints. Hence determine the feasible region and label it $R$.
For the case when $k = 0.8$
1. use the objective line method to find the optimal vertex, $V$, of the feasible region. You must draw and label your objective line and label vertex $V$ clearly.
2. calculate the coordinates of $V$ and hence calculate the corresponding value of $P$ at $V$. Given that for a different value of $k , V$ is not the optimal vertex of $R$,
determine the range of possible values for $k$. You must make your method and working clear.

Edexcel D1 2021 October Q7

7. The numbers listed below are to be packed into bins of size $n$, where $n$ is a positive integer.
14
20
23
17
15
22
19
25

Edexcel D1 2021 October Q20

20
23
17
15
22
19
25
13
28
32 A lower bound for the number of bins required is 4

Determine the range of possible values of $n$. You must make your method clear.
(3)
Carry out a quick sort to produce a list of the numbers in descending order. You should show the result of each pass and identify your pivots clearly.
(4) When the first-fit bin packing algorithm is applied to the original list of numbers, the following allocation is achieved. \end{table}
\includegraphics[max width=\textwidth, alt={}]{d409aaae-811d-4eca-b118-efc927885f97-14_1193_1586_1270_185}
Shortest path from A to J: $\_\_\_\_$
Length of shortest path from A to J: $\_\_\_\_$ \section*{2.
$\_\_\_\_$} \section*{3.}
A B C D E F G H
A - 36 38 40 23 39 38 35
B 36 - 35 36 35 34 41 38
C 38 35 - 39 25 32 40 40
D 40 36 39 - 37 37 26 33
E 23 35 25 37 - 42 24 43
F 39 34 32 37 42 - 45 38
G 38 41 40 26 24 45 - 40
H 35 38 40 33 43 38 40 -

A B C D E F G H
A - 36 38 40 23 39 38 35
B 36 - 35 36 35 34 41 38
C 38 35 - 39 25 32 40 40
D 40 36 39 - 37 37 26 33
E 23 35 25 37 - 42 24 43
F 39 34 32 37 42 - 45 38
G 38 41 40 26 24 45 - 40
H 35 38 40 33 43 38 40 -

A B C D E F G H
A - 36 38 40 23 39 38 35
B 36 - 35 36 35 34 41 38
C 38 35 - 39 25 32 40 40
D 40 36 39 - 37 37 26 33
E 23 35 25 37 - 42 24 43
F 39 34 32 37 42 - 45 38
G 38 41 40 26 24 45 - 40
H 35 38 40 33 43 38 40 -

A B C D E F G H
A - 36 38 40 23 39 38 35
B 36 - 35 36 35 34 41 38
C 38 35 - 39 25 32 40 40
D 40 36 39 - 37 37 26 33
E 23 35 25 37 - 42 24 43
F 39 34 32 37 42 - 45 38
G 38 41 40 26 24 45 - 40
H 35 38 40 33 43 38 40 -
4. \begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{d409aaae-811d-4eca-b118-efc927885f97-22_755_1157_246_404} \captionsetup{labelformat=empty} \caption{Figure 2}
\end{figure}
Activity
Immediately
preceding
activities
A
B
C
D
E

Activity
Immediately
preceding
activities
F
G
H
I
J

Activity
Immediately
preceding
activities
K
L
M
$$v = \ldots \quad x = \ldots \quad y = \ldots$$ \includegraphics[max width=\textwidth, alt={}, center]{d409aaae-811d-4eca-b118-efc927885f97-23_2255_56_315_37}
\includegraphics[max width=\textwidth, alt={}]{d409aaae-811d-4eca-b118-efc927885f97-23_1153_1338_303_310}
\section*{Grid 2} 5. \begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{d409aaae-811d-4eca-b118-efc927885f97-24_591_1433_255_260} \captionsetup{labelformat=empty} \caption{Figure 3
[0pt] [The total weight of the network is 166]}
\end{figure} 6.
\includegraphics[max width=\textwidth, alt={}]{d409aaae-811d-4eca-b118-efc927885f97-26_1287_1645_301_162}
\section*{Diagram 1} 7. $\begin{array} { l l l l l l l l l l l } 14 & 20 & 23 & 17 & 15 & 22 & 19 & 25 & 13 & 28 & 32 \end{array}$

Edexcel D1 2013 Specimen Q1

The table shows the names of nine people.

Use a quick sort to produce the list of names in ascending alphabetical order. You must make your pivots clear.
Use the binary search algorithm on your list to locate the name Paul.

Edexcel D1 2013 Specimen Q2

2. \begin{figure}[h]

\includegraphics[alt={},max width=\textwidth]{5fa867a2-0a3d-4f0b-9f9c-15584f2be5c0-03_719_1161_223_452} \captionsetup{labelformat=empty} \caption{Figure 1}

\end{figure} Figure 1 represents the distances, in metres, between eight vertices, $\mathrm { A } , \mathrm { B } , \mathrm { C } , \mathrm { D } , \mathrm { E } , \mathrm { F } , \mathrm { G }$ and H , in a network.

Use Kruskal's algorithm to find a minimum spanning tree for the network. You should list the arcs in the order in which you consider them. In each case, state whether you are adding the arc to your minimum spanning tree.
Complete Matrix 1 in your answer book, to represent the network.
Starting at A, use Prim's algorithm to determine a minimum spanning tree. You must clearly state the order in which you considered the vertices and the order in which you included the arcs.
State the weight of the minimum spanning tree.

Edexcel D1 2013 Specimen Q3

3. $$\begin{array} { l l l l l l l } 41 & 28 & 42 & 31 & 36 & 32 & 29 \end{array}$$ The numbers in the list represent the weights, in kilograms, of seven statues. They are to be transported in crates that will each hold a maximum weight of 60 kilograms.

Calculate a lower bound for the number of crates that will be needed to transport the statues.
Use the first-fit bin packing algorithm to allocate the statues to the crates.
Use the full bin algorithm to allocate the statues to the crates.
Explain why it is not possible to transport the statues using fewer crates than the number needed for part (c).

Edexcel D1 2013 Specimen Q4

4. \begin{figure}[h]

\includegraphics[alt={},max width=\textwidth]{5fa867a2-0a3d-4f0b-9f9c-15584f2be5c0-05_879_1068_248_497} \captionsetup{labelformat=empty} \caption{Figure 2}

\end{figure} [The total weight of the network is 73.3 km ]
Figure 2 models a network of tunnels that have to be inspected. The number on each arc represents the length, in km , of that tunnel.
Malcolm needs to travel through each tunnel at least once and wishes to minimise the length of his inspection route.
He must start and finish at A .

Use the route inspection algorithm to find the tunnels that will need to be traversed twice. You should make your method and working clear.
Find a route of minimum length, starting and finishing at A . State the length of your route. A new tunnel, CG, is under construction. It will be 10 km long.
Malcolm will have to include the new tunnel in his inspection route.
What effect will the new tunnel have on the total length of his route? Justify your answer.

Edexcel D1 2013 Specimen Q5

5. \begin{figure}[h]

\includegraphics[alt={},max width=\textwidth]{5fa867a2-0a3d-4f0b-9f9c-15584f2be5c0-06_730_597_269_315} \captionsetup{labelformat=empty} \caption{Figure 3}

\end{figure} \begin{figure}[h]

\includegraphics[alt={},max width=\textwidth]{5fa867a2-0a3d-4f0b-9f9c-15584f2be5c0-06_722_583_274_1160} \captionsetup{labelformat=empty} \caption{Figure 4}

\end{figure} Figure 3 shows the possible allocations of six people, Amelia, Charlie, Ellie, Gemma, Jimmy and Saskia, to six tasks, 1, 2, 3, 4, 5 and 6.
Figure 4 shows an initial matching.

Use the maximum matching algorithm once to find an improved matching. You must state the alternating path used and your improved matching.
Explain why a complete matching is not possible. After training, Jimmy can be assigned to tasks 4 or 5 and Ellie to tasks 2, 3, 5 or 6.
Starting with your current maximal matching, use the maximum matching algorithm to obtain a complete matching. You must state the alternating path used and your final matching.

Edexcel D1 2013 Specimen Q6

6. \begin{figure}[h]

\includegraphics[alt={},max width=\textwidth]{5fa867a2-0a3d-4f0b-9f9c-15584f2be5c0-07_602_1182_244_440} \captionsetup{labelformat=empty} \caption{Figure 5}

\end{figure} Figure 5 shows a network of cycle tracks within a national park. The number on each arc represents the time taken, in minutes, to cycle along the corresponding track.

Use Dijkstra's algorithm to find the quickest route from S to T. State your quickest route and the time it takes.
(6)
Explain how you determined your quickest route from your labelled diagram.
Write down the quickest route from E to T .

Edexcel D1 2013 Specimen Q7

7. \begin{figure}[h]

\includegraphics[alt={},max width=\textwidth]{5fa867a2-0a3d-4f0b-9f9c-15584f2be5c0-08_1372_1769_278_189} \captionsetup{labelformat=empty} \caption{Figure 6}

\end{figure} Keith organises two types of children's activity, 'Sports Mad' and 'Circus Fun'. He needs to determine the number of times each type of activity is to be offered. Let $x$ be the number of times he offers the 'Sports Mad' activity. Let $y$ be the number of times he offers the 'Circus Fun' activity. Two constraints are $$\text { and } \quad \begin{aligned} & x \leqslant 15
& y > 6 \end{aligned}$$ These constraints are shown on the graph in Figure 6, where the rejected regions are shaded out.

Explain why $y = 6$ is shown as a dotted line. Two further constraints are $$\begin{aligned} & 3 x \geqslant 2 y
\text { and } \quad 5 x + 4 y & \geqslant 80 \end{aligned}$$
Add two lines and shading to Diagram 1 in the answer book to represent these inequalities. Hence determine the feasible region and label it R . Each 'Sports Mad' activity costs $\pounds 500$.
Each 'Circus Fun' activity costs $\pounds 800$.
Keith wishes to minimise the total cost.
Write down the objective function, C , in terms of $x$ and $y$.
Use your graph to determine the number of times each type of activity should be offered and the total cost. You must show sufficient working to make your method clear.

Edexcel D1 2013 Specimen Q8

8. \begin{figure}[h]

\includegraphics[alt={},max width=\textwidth]{5fa867a2-0a3d-4f0b-9f9c-15584f2be5c0-10_705_1207_248_427} \captionsetup{labelformat=empty} \caption{Figure 7}

\end{figure} A project is modelled by the activity network shown in Figure 7. 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 one worker. The project is to be completed in the shortest possible time.

Complete Diagram 2 in the answer book to show the early and late event times.
State the critical activities.
On Grid 1 in the answer book, draw a cascade (Gantt) chart for this project.
Use your cascade chart to determine a lower bound for the number of workers needed. You must justify your answer. \section*{END}

Edexcel D1 2018 Specimen Q1

The table shows the least distances, in km, between six towns, A, B, C, D, E and F.

	A	B	C	D	E	F
A	-	122	217	137	109	82
B	122	-	110	130	128	204
C	217	110	-	204	238	135
D	137	130	204	-	98	211
E	109	128	238	98	-	113
F	82	204	135	211	113	-

Liz must visit each town at least once. She will start and finish at A and wishes to minimise the total distance she will travel.

Starting with the minimum spanning tree given in your answer book, use the shortcut method to find an upper bound below 810 km for Liz's route. You must state the shortcut(s) you use and the length of your upper bound.
Use the nearest neighbour algorithm, starting at A , to find another upper bound for the length of Liz's route.
Starting by deleting F, and all of its arcs, find a lower bound for the length of Liz's route.
Use your results to write down the smallest interval which you are confident contains the optimal length of the route.

Edexcel D1 2018 Specimen Q3

3.
$12.1 \quad 9.3$
$15.7 \quad 10.9$
17.4
6.4
20.1
7.9
14.0

Use the first-fit bin packing algorithm to determine how the numbers listed above can be packed into bins of size 33 The list is to be sorted into descending order.
1. Starting at the left-hand end of the list, perform two passes through the list using a bubble sort. Write down the state of the list that results at the end of each pass.
2. Write down the total number of comparisons and the total number of swaps performed during your two passes.
Use a quick sort on the original list to obtain a fully sorted list in descending order. You must make your pivots clear.
Use the first-fit decreasing bin packing algorithm to determine how the numbers listed can be packed into bins of size 33
Determine whether your answer to (d) uses the minimum number of bins. You must justify your answer.

	A	B	C	D	E	F	G	H	J
A	-	15	7	25	15	42	64	51	46
B	15	-	22	40	30	57	49	36	31
C	7	22	-	32	22	49	71	58	53
D	25	40	32	-	10	17	57	70	71
E	15	30	22	10	-	27	67	66	61
F	42	57	49	17	27	-	40	53	72
G	64	49	71	57	67	40	-	13	32
H	51	36	58	70	66	53	13	-	19
J	46	31	53	71	61	72	32	19	-

	A	B	C	D	E	F	G	H
A	-	36	38	40	23	39	38	35
B	36	-	35	36	35	34	41	38
C	38	35	-	39	25	32	40	40
D	40	36	39	-	37	37	26	33
E	23	35	25	37	-	42	24	43
F	39	34	32	37	42	-	45	38
G	38	41	40	26	24	45	-	40
H	35	38	40	33	43	38	40	-

	A	B	C	D	E	F	G	H
A	-	36	38	40	23	39	38	35
B	36	-	35	36	35	34	41	38
C	38	35	-	39	25	32	40	40
D	40	36	39	-	37	37	26	33
E	23	35	25	37	-	42	24	43
F	39	34	32	37	42	-	45	38
G	38	41	40	26	24	45	-	40
H	35	38	40	33	43	38	40	-

	A	B	C	D	E	F	G	H
A	-	36	38	40	23	39	38	35
B	36	-	35	36	35	34	41	38
C	38	35	-	39	25	32	40	40
D	40	36	39	-	37	37	26	33
E	23	35	25	37	-	42	24	43
F	39	34	32	37	42	-	45	38
G	38	41	40	26	24	45	-	40
H	35	38	40	33	43	38	40	-

	A	B	C	D	E	F	G	H
A	-	36	38	40	23	39	38	35
B	36	-	35	36	35	34	41	38
C	38	35	-	39	25	32	40	40
D	40	36	39	-	37	37	26	33
E	23	35	25	37	-	42	24	43
F	39	34	32	37	42	-	45	38
G	38	41	40	26	24	45	-	40
H	35	38	40	33	43	38	40	-

	A	B	C	D	E	F	G	H
A	-	36	38	40	23	39	38	35
B	36	-	35	36	35	34	41	38
C	38	35	-	39	25	32	40	40
D	40	36	39	-	37	37	26	33
E	23	35	25	37	-	42	24	43
F	39	34	32	37	42	-	45	38
G	38	41	40	26	24	45	-	40
H	35	38	40	33	43	38	40	-

	A	B	C	D	E	F
A	-	122	217	137	109	82
B	122	-	110	130	128	204
C	217	110	-	204	238	135
D	137	130	204	-	98	211
E	109	128	238	98	-	113
F	82	204	135	211	113	-

	A	B	C	D	E	F	G	H	J
A	-	15	7	25	15	42	64	51	46
B	15	-	22	40	30	57	49	36	31
C	7	22	-	32	22	49	71	58	53
D	25	40	32	-	10	17	57	70	71
E	15	30	22	10	-	27	67	66	61
F	42	57	49	17	27	-	40	53	72
G	64	49	71	57	67	40	-	13	32
H	51	36	58	70	66	53	13	-	19
J	46	31	53	71	61	72	32	19	-

	A	B	C	D	E	F	G	H
A	-	36	38	40	23	39	38	35
B	36	-	35	36	35	34	41	38
C	38	35	-	39	25	32	40	40
D	40	36	39	-	37	37	26	33
E	23	35	25	37	-	42	24	43
F	39	34	32	37	42	-	45	38
G	38	41	40	26	24	45	-	40
H	35	38	40	33	43	38	40	-

	A	B	C	D	E	F	G	H
A	-	36	38	40	23	39	38	35
B	36	-	35	36	35	34	41	38
C	38	35	-	39	25	32	40	40
D	40	36	39	-	37	37	26	33
E	23	35	25	37	-	42	24	43
F	39	34	32	37	42	-	45	38
G	38	41	40	26	24	45	-	40
H	35	38	40	33	43	38	40	-

	A	B	C	D	E	F	G	H
A	-	36	38	40	23	39	38	35
B	36	-	35	36	35	34	41	38
C	38	35	-	39	25	32	40	40
D	40	36	39	-	37	37	26	33
E	23	35	25	37	-	42	24	43
F	39	34	32	37	42	-	45	38
G	38	41	40	26	24	45	-	40
H	35	38	40	33	43	38	40	-

	A	B	C	D	E	F	G	H
A	-	36	38	40	23	39	38	35
B	36	-	35	36	35	34	41	38
C	38	35	-	39	25	32	40	40
D	40	36	39	-	37	37	26	33
E	23	35	25	37	-	42	24	43
F	39	34	32	37	42	-	45	38
G	38	41	40	26	24	45	-	40
H	35	38	40	33	43	38	40	-

	A	B	C	D	E	F	G	H
A	-	36	38	40	23	39	38	35
B	36	-	35	36	35	34	41	38
C	38	35	-	39	25	32	40	40
D	40	36	39	-	37	37	26	33
E	23	35	25	37	-	42	24	43
F	39	34	32	37	42	-	45	38
G	38	41	40	26	24	45	-	40
H	35	38	40	33	43	38	40	-

	A	B	C	D	E	F
A	-	122	217	137	109	82
B	122	-	110	130	128	204
C	217	110	-	204	238	135
D	137	130	204	-	98	211
E	109	128	238	98	-	113
F	82	204	135	211	113	-

Questions — Edexcel D1 (480 questions)

Browse by module

Browse by board

Edexcel D1 2023 June Q8

Edexcel D1 2024 June Q1

Edexcel D1 2024 June Q2

Edexcel D1 2024 June Q3

Edexcel D1 2024 June Q4

Edexcel D1 2024 June Q5

Edexcel D1 2024 June Q6

Edexcel D1 2021 October Q1

Edexcel D1 2021 October Q2

Edexcel D1 2021 October Q3

Edexcel D1 2021 October Q4

Edexcel D1 2021 October Q5

Edexcel D1 2021 October Q6

Edexcel D1 2021 October Q7

Edexcel D1 2021 October Q20

Edexcel D1 2013 Specimen Q1

Edexcel D1 2013 Specimen Q2

Edexcel D1 2013 Specimen Q3

Edexcel D1 2013 Specimen Q4

Edexcel D1 2013 Specimen Q5

Edexcel D1 2013 Specimen Q6

Edexcel D1 2013 Specimen Q7

Edexcel D1 2013 Specimen Q8

Edexcel D1 2018 Specimen Q1

Edexcel D1 2018 Specimen Q3

	A	B	C	D	E	F	G	H	J
A	-	15	7	25	15	42	64	51	46
B	15	-	22	40	30	57	49	36	31
C	7	22	-	32	22	49	71	58	53
D	25	40	32	-	10	17	57	70	71
E	15	30	22	10	-	27	67	66	61
F	42	57	49	17	27	-	40	53	72
G	64	49	71	57	67	40	-	13	32
H	51	36	58	70	66	53	13	-	19
J	46	31	53	71	61	72	32	19	-

	A	B	C	D	E	F	G	H
A	-	36	38	40	23	39	38	35
B	36	-	35	36	35	34	41	38
C	38	35	-	39	25	32	40	40
D	40	36	39	-	37	37	26	33
E	23	35	25	37	-	42	24	43
F	39	34	32	37	42	-	45	38
G	38	41	40	26	24	45	-	40
H	35	38	40	33	43	38	40	-

	A	B	C	D	E	F	G	H
A	-	36	38	40	23	39	38	35
B	36	-	35	36	35	34	41	38
C	38	35	-	39	25	32	40	40
D	40	36	39	-	37	37	26	33
E	23	35	25	37	-	42	24	43
F	39	34	32	37	42	-	45	38
G	38	41	40	26	24	45	-	40
H	35	38	40	33	43	38	40	-

	A	B	C	D	E	F	G	H
A	-	36	38	40	23	39	38	35
B	36	-	35	36	35	34	41	38
C	38	35	-	39	25	32	40	40
D	40	36	39	-	37	37	26	33
E	23	35	25	37	-	42	24	43
F	39	34	32	37	42	-	45	38
G	38	41	40	26	24	45	-	40
H	35	38	40	33	43	38	40	-

	A	B	C	D	E	F	G	H
A	-	36	38	40	23	39	38	35
B	36	-	35	36	35	34	41	38
C	38	35	-	39	25	32	40	40
D	40	36	39	-	37	37	26	33
E	23	35	25	37	-	42	24	43
F	39	34	32	37	42	-	45	38
G	38	41	40	26	24	45	-	40
H	35	38	40	33	43	38	40	-

	A	B	C	D	E	F	G	H
A	-	36	38	40	23	39	38	35
B	36	-	35	36	35	34	41	38
C	38	35	-	39	25	32	40	40
D	40	36	39	-	37	37	26	33
E	23	35	25	37	-	42	24	43
F	39	34	32	37	42	-	45	38
G	38	41	40	26	24	45	-	40
H	35	38	40	33	43	38	40	-

	A	B	C	D	E	F
A	-	122	217	137	109	82
B	122	-	110	130	128	204
C	217	110	-	204	238	135
D	137	130	204	-	98	211
E	109	128	238	98	-	113
F	82	204	135	211	113	-