Questions - Edexcel D1 - A-Level Maths

Activity	Must be preceded by
A	-
B	-
C	$B$
D	A, C
E	$A$
$F$	E
$G$	E
H	G
I	D, F
J	G, I
K	G, I
$L$	H, K

An activity on arc network is to be drawn to model this production process.

Explain why it is necessary to use at least two dummies when drawing the activity network.
(2)
Draw the activity network using exactly two dummies.
(5)

Edexcel D1 2005 January Q3

3. \begin{figure}[h]

\captionsetup{labelformat=empty} \caption{Figure 2} \includegraphics[alt={},max width=\textwidth]{e64b50bc-13a3-4051-b8c1-d4e7ea49e3a5-4_622_1363_301_317}

\end{figure} The network in Figure 2 shows the distances, in metres, between 10 wildlife observation points. The observation points are to be linked by footpaths, to form a network along the arcs indicated, using the least possible total length.

Find a minimum spanning tree for the network in Figure 2, showing clearly the order in which you selected the arcs for your tree, using
1. Kruskal's algorithm,
2. Prim's algorithm, starting from $A$. Given that footpaths are already in place along $A B$ and $F I$ and so should be included in the spanning tree,
explain which algorithm you would choose to complete the tree, and how it should be adapted. (You do not need to find the tree.)
(2)

Edexcel D1 2005 January Q4

4. $\quad \begin{array} { l l l l l l l l l l } 650 & 431 & 245 & 643 & 455 & 134 & 710 & 234 & 162 & 452 \end{array}$

The list of numbers above is to be sorted into descending order. Perform a Quick Sort to obtain the sorted list, giving the state of the list after each pass, indicating the pivot elements.
(5) The numbers in the list represent the lengths, in mm, of some pieces of wood. The wood is sold in one metre lengths.
Use the first-fit decreasing bin packing algorithm to determine how these pieces could be cut from the minimum number of one metre lengths. (You should ignore wastage due to cutting.)
(4)
Determine whether your solution to part (b) is optimal. Give a reason for your answer.
(2)

Edexcel D1 2005 January Q5

5. \begin{figure}[h]

\captionsetup{labelformat=empty} \caption{Figure 3} \includegraphics[alt={},max width=\textwidth]{e64b50bc-13a3-4051-b8c1-d4e7ea49e3a5-5_590_1360_1265_331}

\end{figure} Figure 3 shows a network of paths. The number on each arc gives the distance, in metres, of that path.

Use Dijkstra's algorithm to find the shortest distance from $A$ to $H$.
(5)
Solve the route inspection problem for the network shown in Figure 3. You should make your method and working clear. State a shortest route, starting at $A$, and find its length.
[0pt] [The total weight of the network is 1241]
(6) \begin{figure}[h]
\captionsetup{labelformat=empty} \caption{Figure 4} \includegraphics[alt={},max width=\textwidth]{e64b50bc-13a3-4051-b8c1-d4e7ea49e3a5-6_634_1486_301_312}
\end{figure} Figure 4 shows a capacitated directed network. The number on each arc is its capacity.
(a) State the maximum flow along
SADT,
SCET,
$S B F T$.
(b) Show these maximum flows on Diagram 1 in the answer book. Take your answer to part (b) as the initial flow pattern.
(c) (i) Use the labelling procedure to find a maximum flow from $S$ to $T$. Your working should be shown on Diagram 2 in the answer book. List each flow-augmenting route you use, together with its flow.
Draw your final flow pattern on Diagram 3 in the answer book.
Prove that your flow is maximal.
(d) Give an example of a practical situation that could have been modelled by the original network.

Edexcel D1 2005 January Q7

7. Flatland UK Ltd makes three types of carpet, the Lincoln, the Norfolk and the Suffolk. The carpets all require units of black, green and red wool. For each roll of carpet, the Lincoln requires 1 unit of black, 1 of green and 3 of red, the Norfolk requires 1 unit of black, 2 of green and 2 of red, and the Suffolk requires 2 units of black, 1 of green and 1 of red. There are up to 30 units of black, 40 units of green and 50 units of red available each day. Profits of $\pounds 50 , \pounds 80$ and $\pounds 60$ are made on each roll of Lincoln, Norfolk and Suffolk respectively. Flatland UK Ltd wishes to maximise its profit. Let the number of rolls of the Lincoln, Norfolk and Suffolk made daily be $x , y$ and $z$ respectively.

Formulate the above situation as a linear programming problem, listing clearly the constraints as inequalities in their simplest form, and stating the objective function. This problem is to be solved using the Simplex algorithm. The most negative number in the profit row is taken to indicate the pivot column at each stage.

Stating your row operations, show that after one complete iteration the tableau becomes

Basic variable	$x$	$y$	$z$	$r$	$s$	$t$	Value
$r$	$\frac { 1 } { 2 }$	0	$1 \frac { 1 } { 2 }$	1	$- \frac { 1 } { 2 }$	0	10
$y$	$\frac { 1 } { 2 }$	1	$\frac { 1 } { 2 }$	0	$\frac { 1 } { 2 }$	0	20
$t$	2	0	0	0	-1	1	10
$P$	-10	0	-20	0	40	0	1600

Explain the practical meaning of the value 10 in the top row.
1. Perform one further complete iteration of the Simplex algorithm.
2. State whether your current answer to part (d)(i) is optimal. Give a reason for your answer.
3. Interpret your current tableau, giving the value of each variable.

Edexcel D1 2006 January Q1

1. \begin{figure}[h]

\captionsetup{labelformat=empty} \caption{Figure 1} \includegraphics[alt={},max width=\textwidth]{fd0401c4-bf18-4c3b-af1d-cd1b633c6853-2_791_452_436_483}

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

\captionsetup{labelformat=empty} \caption{Figure 2} \includegraphics[alt={},max width=\textwidth]{fd0401c4-bf18-4c3b-af1d-cd1b633c6853-2_796_465_433_1226}

\end{figure} A taxi firm has six taxis $A , B , C , D , E$ and $F$, available for six journeys, $1,2,3,4,5$ and 6 , which are booked for 9 a.m. tomorrow. The bipartite graph shown in Figure 1 shows the possible matchings. Initially $A$, $B$, $C$ and $D$ are matched to 5, 2, 3 and 6 respectively, as indicated in Figure 2.

Explain why it is necessary to perform the maximum matching algorithm twice in order to try to obtain a complete matching.
Use the maximum matching algorithm twice to obtain a complete matching. List clearly the alternating paths you use.
(6)

Edexcel D1 2006 January Q2

	$A$	B	$C$	D	$E$	$F$	$G$
A	-	48	117	92	-	-	-
B	48	-	-	-	-	63	55
C	117	-	-	28	-	-	85
D	92	-	28	-	58	132	-
E	-	-	-	58	-	124	-
$F$	-	63	-	132	124	-	-
G	-	55	85	-	-	-	-

The table shows the lengths, in metres, of the paths between seven vertices $A , B , C , D , E , F$ and $G$ in a network N.

Use Prim's algorithm, starting at $A$, to solve the minimum connector problem for this table of distances. You must clearly state the order in which you selected the edges of your tree, and the weight of your final tree. Draw your tree using the vertices given in Diagram 1 in the answer book.
Draw N using the vertices given in Diagram 2 in the answer book.
Solve the Route Inspection problem for N. You must make your method of working clear. State a shortest route and find its length. (The weight of N is 802 .)
(7) \section*{3.}

Edexcel D1 2006 January Q3

3. \begin{figure}[h]

\captionsetup{labelformat=empty} \caption{Figure 3} \includegraphics[alt={},max width=\textwidth]{fd0401c4-bf18-4c3b-af1d-cd1b633c6853-4_1670_1067_277_416}

\end{figure} An algorithm is described by the flow chart shown in Figure 3.

Complete the table in the answer book recording the results of each step as the algorithm is applied.
(Notice that values of $A , B , C$ and $D$ are to be given to 3 decimal places, and the values of $E$ to 1 significant figure.)
Write down the output from the algorithm.

Edexcel D1 2006 January Q4

4. (a) Define the terms

cut,
minimum cut,
as applied to a directed network flow.
(2) \begin{figure}[h]
\captionsetup{labelformat=empty} \caption{Figure 4} \includegraphics[alt={},max width=\textwidth]{fd0401c4-bf18-4c3b-af1d-cd1b633c6853-5_845_1610_713_294}
\end{figure} Figure 4 shows a capacitated directed network and two cuts $C _ { 1 }$ and $C _ { 2 }$. The number on each arc is its capacity.
(b) State the values of the cuts $C _ { 1 }$ and $C _ { 2 }$.
(3) Given that one of these two cuts is a minimum cut,
(c) find a maximum flow pattern by inspection, and show it on the diagram in the answer book.
(d) Find a second minimum cut for this network.
(1) In order to increase the flow through the network it is decided to add an arc of capacity 100 joining $D$ either to $E$ or to $G$.
(e) State, with a reason, which of these arcs should be added, and the value of the increased flow.
(2) \begin{figure}[h]
\captionsetup{labelformat=empty} \caption{Figure 5} \includegraphics[alt={},max width=\textwidth]{fd0401c4-bf18-4c3b-af1d-cd1b633c6853-6_649_1496_320_294}
\end{figure} The network in Figure 5 shows the activities involved in a process. The activities are represented by the arcs. The number in brackets on each arc gives the time, in days, taken to complete the activity.
(a) Calculate the early time and late time for each event, showing them on the diagram in the answer book.
(b) Determine the critical activities and the length of the critical path.
(c) On the grid in the answer book, draw a cascade (Gantt) chart for the process. Each activity requires only one worker, and workers may not share an activity.
(d) Use your cascade chart to determine the minimum numbers of workers required to complete the process in the minimum time. Explain your reasoning clearly.
(e) Schedule the activities, using the number of workers you found in part (d), so that the process is completed in the shortest time.

Edexcel D1 2006 January Q6

6. A company produces two types of party bag, Infant and Junior. Both types of bag contain a balloon, a toy and a whistle. In addition the Infant bag contains 3 sweets and 3 stickers and the Junior bag contains 10 sweets and 2 stickers. The sweets and stickers are produced in the company's factory. The factory can produce up to 3000 sweets per hour and 1200 stickers per hour. The company buys a large supply of balloons, toys and whistles. Market research indicates that at least twice as many Infant bags as Junior bags should be produced. Both types of party bag are sold at a profit of 15p per bag. All the bags are sold. The company wishes to maximise its profit. Let $x$ be the number of Infant bags produced and $y$ be the number of Junior bags produced per hour.

Formulate the above situation as a linear programming problem.
Represent your inequalities graphically, indicating clearly the feasible region.
Find the number of Infant bags and Junior bags that should be produced each hour and the maximum hourly profit. Make your method clear. In order to increase the profit further, the company decides to buy additional equipment. It can buy equipment to increase the production of either sweets or stickers, but not both.
Using your graph, explain which equipment should be bought, giving your reasoning. The manager of the company does not understand why the balloons, toys and whistles have not been considered in the above calculations.
Explain briefly why they do not need to be considered.

Edexcel D1 2007 January Q1

Use the binary search algorithm to try to locate the name NIGEL in the following alphabetical list. Clearly indicate how you chose your pivots and which part of the list is being rejected at each stage.
Bhavika
Clive
Elizabeth
John
Mark
Nicky
Preety
Steve
Trevor
Verity
(Total 4 marks)

\begin{figure}[h]

\captionsetup{labelformat=empty} \caption{Figure 1} \includegraphics[alt={},max width=\textwidth]{6a0cf9b1-e6a0-4c38-a2d9-deb9c0c76015-03_554_535_278_372}

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

\captionsetup{labelformat=empty} \caption{Figure 2} \includegraphics[alt={},max width=\textwidth]{6a0cf9b1-e6a0-4c38-a2d9-deb9c0c76015-03_558_538_276_1064}

\end{figure} Figure 1 shows the possible allocations of five people, Ellen, George, Jo, Lydia and Yi Wen to five tasks, 1, 2, 3, 4 and 5. Figure 2 shows an initial matching.

Find an alternating path linking George with 5. List the resulting improved matching this gives.
Explain why it is not possible to find a complete matching. George now has task 2 added to his possible allocation.
Using the improved matching found in part (a) as the new initial matching, find an alternating path linking Yi Wen with task 1 to find a complete matching. List the complete matching.

Edexcel D1 2007 January Q3

3. \begin{figure}[h]

\captionsetup{labelformat=empty} \caption{Figure 3} \includegraphics[alt={},max width=\textwidth]{6a0cf9b1-e6a0-4c38-a2d9-deb9c0c76015-04_424_586_269_760}

\end{figure}

Write down the name given to the type of graph drawn in Figure 3. A Hamiltonian cycle for the graph in Figure 3 begins $\mathrm { A } , 3 , \mathrm {~B} , \ldots$.
Complete this Hamiltonian cycle.
Starting with the Hamiltonian cycle found in (b), use the planarity algorithm to determine if the graph is planar.

Edexcel D1 2007 January Q4

4. A three-variable linear programming problem in $x , y$ and $z$ is to be solved. The objective is to maximise the profit $P$. The following initial tableau was obtained.

Basic variable	$x$	$y$	$z$	$r$	$s$	Value
$r$	2	0	4	1	0	80
$s$	1	4	2	0	1	160
$P$	- 2	- 8	- 20	0	0	0

Taking the most negative number in the profit row to indicate the pivot column, perform one complete iteration of the simplex algorithm, to obtain tableau $T$. State the row operations that you use.
Write down the profit equation shown in tableau $T$.
State whether tableau $T$ is optimal. Give a reason for your answer.

Edexcel D1 2007 January Q5

5. (a) Explain why a network cannot have an odd number of vertices of odd degree. \begin{figure}[h]

\captionsetup{labelformat=empty} \caption{Figure 4} \includegraphics[alt={},max width=\textwidth]{6a0cf9b1-e6a0-4c38-a2d9-deb9c0c76015-06_620_1154_450_443}

\end{figure} Figure 4 shows a network of paths in a public park. The number on each arc represents the length of that path in metres. Hamish needs to walk along each path at least once to check the paths for frost damage starting and finishing at $A$. He wishes to minimise the total distance he walks.
(b) Use the route inspection algorithm to find which paths, if any, need to be traversed twice.
(c) Find the length of Hamish's route.
[0pt] [The total weight of the network in Figure 4 is 4180 m .]

Edexcel D1 2007 January Q6

6. \begin{figure}[h]

\captionsetup{labelformat=empty} \caption{Figure 5} \includegraphics[alt={},max width=\textwidth]{6a0cf9b1-e6a0-4c38-a2d9-deb9c0c76015-07_659_1404_264_317}

\end{figure} A project is modelled by the activity network shown in Figure 5. The activities are represented by the arcs. The number in brackets on each arc gives the time, in hours, to complete the activity. The numbers in circles are the event numbers. Each activity requires one worker.

Explain the purpose of the dotted line from event 6 to event 8 .
(1)
Calculate the early time and late time for each event. Write these in the boxes in the answer book.
Calculate the total float on activities $D , E$ and $F$.
Determine the critical activities.
Given that the sum of all the times of the activities is 95 hours, calculate a lower bound for the number of workers needed to complete the project in the minimum time. You must show your working.
Given that workers may not share an activity, schedule the activities so that the process is completed in the shortest time using the minimum number of workers. \begin{figure}[h]
\captionsetup{labelformat=empty} \caption{Figure 6} \includegraphics[alt={},max width=\textwidth]{6a0cf9b1-e6a0-4c38-a2d9-deb9c0c76015-08_1502_1655_285_196}
\end{figure} The captain of the Malde Mare takes passengers on trips across the lake in her boat.
The number of children is represented by $x$ and the number of adults by $y$.
Two of the constraints limiting the number of people she can take on each trip are $$x < 10$$ and $$2 \leqslant y \leqslant 10$$ These are shown on the graph in Figure 6, where the rejected regions are shaded out.
Explain why the line $x = 10$ is shown as a dotted line.
(1)
Use the constraints to write down statements that describe the number of children and the number of adults that can be taken on each trip.
(3) For each trip she charges $\pounds 2$ per child and $\pounds 3$ per adult. She must take at least $\pounds 24$ per trip to cover costs. The number of children must not exceed twice the number of adults.
Use this information to write down two inequalities.
(2)
Add two lines and shading to Diagram 1 in your answer book to represent these inequalities. Hence determine the feasible region and label it R .
Use your graph to determine how many children and adults would be on the trip if the captain takes:
1. the minimum number of passengers,
2. the maximum number of passengers. \begin{figure}[h]
  \captionsetup{labelformat=empty} \caption{Figure 7} \includegraphics[alt={},max width=\textwidth]{6a0cf9b1-e6a0-4c38-a2d9-deb9c0c76015-10_1018_1600_285_221}
  \end{figure} In solving a network flow problem using the labelling procedure, the diagram in Figure 7 was created.
  The arrow on each arc indicates the direction of the flow along that arc.
  The arrows above and below each arc show the direction and value of the flow as indicated by the labelling procedure.
Add a supersource S , a supersink T and appropriate arcs to Diagram 2 in the answer book, and complete the labelling procedure for these arcs.
Write down the value of the initial flow shown in Figure 7.
Use Diagram 2, the initial flow and the labelling procedure to find the maximal flow of 124 through this network. List each flow-augmenting path you use, together with its flow.
Show your flow on Diagram 3 and state its value.
Prove that your flow is maximal.

Edexcel D1 2008 January Q1

(a) Define the terms
1. alternating path,
2. matching.
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{7396d930-0143-4876-b019-a4d73e09b172-2_568_621_689_344} \captionsetup{labelformat=empty} \caption{Figure 1}
\end{figure} \begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{7396d930-0143-4876-b019-a4d73e09b172-2_554_540_701_1171} \captionsetup{labelformat=empty} \caption{Figure 2}
\end{figure} At a school fair, five teachers, $A , B , C , D$ and $E$, are to supervise five stalls, $1,2,3,4$ and 5 .
A bipartite graph showing their possible allocations is given in Figure 1. An initial matching is given in Figure 2.
(b) Use the maximum matching algorithm twice to obtain a complete matching. List clearly the alternating paths you use.

Edexcel D1 2008 January Q2

2. (a)
$\begin{array} { l l l l l l l l l l l } 18 & 20 & 11 & 7 & 17 & 15 & 14 & 21 & 23 & 16 & 9 \end{array}$ The list of numbers shown above is to be sorted into ascending order. Apply quick sort to obtain the sorted list. You must make your pivots clear. \begin{figure}[h]

\includegraphics[alt={},max width=\textwidth]{7396d930-0143-4876-b019-a4d73e09b172-3_839_1275_614_395} \captionsetup{labelformat=empty} \caption{Figure 3}

\end{figure} Figure 3 represents a network of paths in a park. The number on each arc represents the length of the path in metres.
(b) Using your answer to part (a) and Kruskal's algorithm, find a minimum spanning tree for the network in Figure 3. You should list the arcs in the order in which you consider them and state whether you are adding it to your minimum spanning tree.
(c) Find the total weight of the minimum spanning tree.

Edexcel D1 2008 January Q3

3. \begin{figure}[h]

\includegraphics[alt={},max width=\textwidth]{7396d930-0143-4876-b019-a4d73e09b172-4_755_1132_239_468} \captionsetup{labelformat=empty} \caption{Figure 4}

\end{figure} Figure 4 models a network of roads in a housing estate. The number on each arc represents the length, in km , of the road. The total weight of the network is 11 km .
A council worker needs to travel along each road once to inspect the road surface. He will start and finish at A and wishes to minimise the length of his route.

Use an appropriate algorithm to find a route for the council worker. You should make your method and working clear. State your route and its length.
(6) A postal worker needs to walk along each road twice, once on each side of the road. She must start and finish at A . The length of her route is to be minimised. You should ignore the width of the road.
1. Explain how this differs from the standard route inspection problem.
  (1)
2. Find the length of the shortest route for the postal worker.
  (2)

Edexcel D1 2008 January Q4

4. \begin{figure}[h]

\includegraphics[alt={},max width=\textwidth]{7396d930-0143-4876-b019-a4d73e09b172-5_1079_1392_267_338} \captionsetup{labelformat=empty} \caption{Figure 5}

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

Calculate the missing early and late times and hence complete Diagram 1 in your answer book.
Calculate the total float on activities D, G and I. You must make your calculations clear.
List the critical activities. Each activity requires one worker.
Calculate a lower bound for the number of workers needed to complete the project in the minimum time.
(2)

Edexcel D1 2008 January Q5

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

Activity	Immediately preceding activities
A	-
B	-
C	A
D	B
E	B, C
F	B, C

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

Edexcel D1 2008 January Q6

6. (a) Define the term 'cut' as it applies to a directed network.
(2) \begin{figure}[h]

\includegraphics[alt={},max width=\textwidth]{7396d930-0143-4876-b019-a4d73e09b172-7_659_1367_376_349} \captionsetup{labelformat=empty} \caption{Figure 6}

\end{figure} Figure 6 shows a capacitated, directed network. The number on each arc represents the capacity of that arc. The numbers in circles represent an initial flow.
(b) Complete the labelling procedure on Diagram 2 in your answer book by entering values along CE, EG, HT and GT.
(c) Find the maximum flow through the network. You must list each flow-augmenting route you use together with its flow.
(d) Show a maximal flow pattern on Diagram 3 in your answer book.
(e) State the value of the maximum flow through the network.
(f) Prove that your flow is maximal.

Edexcel D1 2008 January Q7

7. \begin{figure}[h]

\includegraphics[alt={},max width=\textwidth]{7396d930-0143-4876-b019-a4d73e09b172-8_2158_1803_239_137} \captionsetup{labelformat=empty} \caption{Figure 7}

\end{figure}

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

Phil decides to use graphical linear programming to help him optimise the numbers of each type of box he should produce each day. Each day Phil produces $x$ vegetarian boxes and $y$ non-vegetarian boxes.
One of the constraints limiting the number of boxes is $$x + y \geqslant 70$$ This, together with $x \geqslant 0 , y \geqslant 0$ and a fourth constraint, has been represented in Figure 7. The rejected region has been shaded.

Write down the inequality represented by the fourth constraint. Two further constraints are: $$\begin{aligned} & x + 2 y \leqslant 160
& \text { and } y > 60 \end{aligned}$$
Add two lines and shading to Diagram 4 in your answer book to represent these inequalities.
Hence determine and label the feasible region, R .
Use your graph to determine the minimum total number of boxes he needs to prepare each day. Make your method clear. Phil makes a profit of $\pounds 1.20$ on each vegetarian box and $\pounds 1.40$ on each non-vegetarian box. He wishes to maximise his profit.
Write down the objective function.
Use your graph to obtain the optimal number of vegetarian and non-vegetarian boxes he should produce each day. You must make your method clear.
Find Phil's maximum daily profit.

Edexcel D1 2009 January Q1

1. Max Lauren John Hannah Kieran Tara Richard Imogen

Use a quick sort to produce a list of these names in ascending alphabetical order. You must make your pivots clear.
Use the binary search algorithm on your list from part (a) to try to locate the name 'Hugo'.

Edexcel D1 2009 January Q2

	$\mathbf { A }$	$\mathbf { B }$	$\mathbf { C }$	$\mathbf { D }$	$\mathbf { E }$	$\mathbf { F }$
$\mathbf { A }$	-	24	-	-	23	22
$\mathbf { B }$	24	-	18	19	17	20
$\mathbf { C }$	-	18	-	11	14	-
$\mathbf { D }$	-	19	11	-	13	-
$\mathbf { E }$	23	17	14	13	-	21
$\mathbf { F }$	22	20	-	-	21	-

The table shows the distances, in metres, between six vertices, $\mathbf { A } , \mathbf { B } , \mathbf { C } , \mathbf { D } , \mathbf { E }$ and $\mathbf { F }$, in a network.

Draw the weighted network using the vertices given in Diagram 1 in the answer booklet.
Use Kruskal's algorithm to find a minimum spanning tree. You should list the edges in the order that you consider them and state whether you are adding them to your minimum spanning tree.
Draw your tree on Diagram 2 in the answer booklet and find its total weight.

Edexcel D1 2009 January Q3

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

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

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

Basic variable	\(x\)	\(y\)	\(z\)	\(r\)	\(s\)	\(t\)	Value
\(r\)	\(\frac { 1 } { 2 }\)	0	\(1 \frac { 1 } { 2 }\)	1	\(- \frac { 1 } { 2 }\)	0	10
\(y\)	\(\frac { 1 } { 2 }\)	1	\(\frac { 1 } { 2 }\)	0	\(\frac { 1 } { 2 }\)	0	20
\(t\)	2	0	0	0	-1	1	10
\(P\)	-10	0	-20	0	40	0	1600

Basic variable	\(x\)	\(y\)	\(z\)	\(r\)	\(s\)	Value
\(r\)	2	0	4	1	0	80
\(s\)	1	4	2	0	1	160
\(P\)	- 2	- 8	- 20	0	0	0

Activity	Must be preceded by
A	-
B	-
C	\(B\)
D	A, C
E	\(A\)
\(F\)	E
\(G\)	E
H	G
I	D, F
J	G, I
K	G, I
\(L\)	H, K

	\(A\)	B	\(C\)	D	\(E\)	\(F\)	\(G\)
A	-	48	117	92	-	-	-
B	48	-	-	-	-	63	55
C	117	-	-	28	-	-	85
D	92	-	28	-	58	132	-
E	-	-	-	58	-	124	-
\(F\)	-	63	-	132	124	-	-
G	-	55	85	-	-	-	-

	\(\mathbf { A }\)	\(\mathbf { B }\)	\(\mathbf { C }\)	\(\mathbf { D }\)	\(\mathbf { E }\)	\(\mathbf { F }\)
\(\mathbf { A }\)	-	24	-	-	23	22
\(\mathbf { B }\)	24	-	18	19	17	20
\(\mathbf { C }\)	-	18	-	11	14	-
\(\mathbf { D }\)	-	19	11	-	13	-
\(\mathbf { E }\)	23	17	14	13	-	21
\(\mathbf { F }\)	22	20	-	-	21	-

Questions — Edexcel D1 (480 questions)

Browse by module

Browse by board

Edexcel D1 2005 January Q2

Edexcel D1 2005 January Q3

Edexcel D1 2005 January Q4

Edexcel D1 2005 January Q5

Edexcel D1 2005 January Q7

Edexcel D1 2006 January Q1

Edexcel D1 2006 January Q2

Edexcel D1 2006 January Q3

Edexcel D1 2006 January Q4

Edexcel D1 2006 January Q6

Edexcel D1 2007 January Q1

Edexcel D1 2007 January Q3

Edexcel D1 2007 January Q4

Edexcel D1 2007 January Q5

Edexcel D1 2007 January Q6

Edexcel D1 2008 January Q1

Edexcel D1 2008 January Q2

Edexcel D1 2008 January Q3

Edexcel D1 2008 January Q4

Edexcel D1 2008 January Q5

Edexcel D1 2008 January Q6

Edexcel D1 2008 January Q7

Edexcel D1 2009 January Q1

Edexcel D1 2009 January Q2

Edexcel D1 2009 January Q3