Questions (33218 questions)

Browse by module
All questions AEA AS Paper 1 AS Paper 2 AS Pure C1 C12 C2 C3 C34 C4 CP AS CP1 CP2 D1 D2 F1 F2 F3 FD1 FD1 AS FD2 FD2 AS FM1 FM1 AS FM2 FM2 AS FP1 FP1 AS FP2 FP2 AS FP3 FS1 FS1 AS FS2 FS2 AS Further AS Paper 1 Further AS Paper 2 Discrete Further AS Paper 2 Mechanics Further AS Paper 2 Statistics Further Additional Pure Further Additional Pure AS Further Discrete Further Discrete AS Further Extra Pure Further Mechanics Further Mechanics A AS Further Mechanics AS Further Mechanics B AS Further Mechanics Major Further Mechanics Minor Further Numerical Methods Further Paper 1 Further Paper 2 Further Paper 3 Further Paper 3 Discrete Further Paper 3 Mechanics Further Paper 3 Statistics Further Paper 4 Further Pure Core Further Pure Core 1 Further Pure Core 2 Further Pure Core AS Further Pure with Technology Further Statistics Further Statistics A AS Further Statistics AS Further Statistics B AS Further Statistics Major Further Statistics Minor Further Unit 1 Further Unit 2 Further Unit 3 Further Unit 4 Further Unit 5 Further Unit 6 H240/01 H240/02 H240/03 M1 M2 M3 M4 M5 P1 P2 P3 P4 PMT Mocks PURE Paper 1 Paper 2 Paper 3 Pre-U 9794/1 Pre-U 9794/2 Pre-U 9794/3 Pre-U 9795 Pre-U 9795/1 Pre-U 9795/2 S1 S2 S3 S4 Unit 1 Unit 2 Unit 3 Unit 4
Browse by board
AQA AS Paper 1 AS Paper 2 C1 C2 C3 C4 D1 D2 FP1 FP2 FP3 Further AS Paper 1 Further AS Paper 2 Discrete Further AS Paper 2 Mechanics Further AS Paper 2 Statistics Further Paper 1 Further Paper 2 Further Paper 3 Discrete Further Paper 3 Mechanics Further Paper 3 Statistics M1 M2 M3 Paper 1 Paper 2 Paper 3 S1 S2 S3 CAIE FP1 FP2 Further Paper 1 Further Paper 2 Further Paper 3 Further Paper 4 M1 M2 P1 P2 P3 S1 S2 Edexcel AEA AS Paper 1 AS Paper 2 C1 C12 C2 C3 C34 C4 CP AS CP1 CP2 D1 D2 F1 F2 F3 FD1 FD1 AS FD2 FD2 AS FM1 FM1 AS FM2 FM2 AS FP1 FP1 AS FP2 FP2 AS FP3 FS1 FS1 AS FS2 FS2 AS M1 M2 M3 M4 M5 P1 P2 P3 P4 PMT Mocks PURE Paper 1 Paper 2 Paper 3 S1 S2 S3 S4 OCR AS Pure C1 C2 C3 C4 D1 D2 FD1 AS FM1 AS FP1 FP1 AS FP2 FP3 FS1 AS Further Additional Pure Further Additional Pure AS Further Discrete Further Discrete AS Further Mechanics Further Mechanics AS Further Pure Core 1 Further Pure Core 2 Further Pure Core AS Further Statistics Further Statistics AS H240/01 H240/02 H240/03 M1 M2 M3 M4 PURE S1 S2 S3 S4 OCR MEI AS Paper 1 AS Paper 2 C1 C2 C3 C4 D1 D2 FP1 FP2 FP3 Further Extra Pure Further Mechanics A AS Further Mechanics B AS Further Mechanics Major Further Mechanics Minor Further Numerical Methods Further Pure Core Further Pure Core AS Further Pure with Technology Further Statistics A AS Further Statistics B AS Further Statistics Major Further Statistics Minor M1 M2 M3 M4 Paper 1 Paper 2 Paper 3 S1 S2 S3 S4 Pre-U Pre-U 9794/1 Pre-U 9794/2 Pre-U 9794/3 Pre-U 9795 Pre-U 9795/1 Pre-U 9795/2 WJEC Further Unit 1 Further Unit 2 Further Unit 3 Further Unit 4 Further Unit 5 Further Unit 6 Unit 1 Unit 2 Unit 3 Unit 4
Sort by: Default | Easiest first | Hardest first
OCR Further Statistics AS 2024 June Q4
12 marks Challenging +1.2
  1. Find the probability that 4 telephone calls are received in a randomly chosen one-minute period.
  2. A sample of 10 independent observations of \(X\) is obtained. Find the expected number of these 10 observations that are in the interval \(2 < X < 8\). It is also known that \(P ( X + Y = 4 ) = \frac { 27 } { 8 } P ( X = 2 ) \times P ( Y = 2 )\).
  3. Determine the possible values of \(\mathrm { E } ( Y )\).
  4. Explain where in your solution to part (c) you have used the assumption that telephone calls and e-mails are received independently of one another.
OCR Further Mechanics AS 2019 June Q5
14 marks Standard +0.8
  1. By considering forces on \(R\), express \(T _ { 2 }\) in terms of \(m _ { 2 }\).
  2. Show that
    1. \(T _ { 1 } = \frac { 49 } { 4 } \left( m _ { 1 } + m _ { 2 } \right)\),
    2. \(\omega ^ { 2 } = \frac { 49 \left( m _ { 1 } + 2 m _ { 2 } \right) } { 4 m _ { 1 } }\).
  3. Deduce that, in the case where \(m _ { 1 }\) is much bigger than \(m _ { 2 } , \omega \approx 3.5\). In a different case, where \(m _ { 1 } = 2.5\) and \(m _ { 2 } = 2.8 , P\) slows down. Eventually the system comes to rest with \(P\) and \(R\) hanging in equilibrium.
  4. Find the total energy lost by \(P\) and \(R\) as the angular velocity of \(P\) changes from the initial value of \(\omega \mathrm { rads } ^ { - 1 }\) to zero.
OCR Further Pure Core 2 2019 June Q6
6 marks Standard +0.8
  1. Show that the motion of the particle can be modelled by the differential equation $$\frac { \mathrm { d } v } { \mathrm {~d} t } + \frac { 1 } { 2 } v = \frac { 1 } { 4 } t$$ The particle is at rest when \(t = 0\).
  2. Find \(v\) in terms of \(t\).
  3. Find the velocity of the particle when \(t = 2\). When \(t = 2\) the force acting in the positive \(x\)-direction is replaced by a constant force of magnitude \(\frac { 1 } { 2 } \mathrm {~N}\) in the same direction.
  4. Refine the differential equation given in part (a) to model the motion for \(t \geqslant 2\).
  5. Use the refined model from part (d) to find an exact expression for \(v\) in terms of \(t\) for \(t \geqslant 2\). \(6 \quad A\) is a fixed point on a smooth horizontal surface. A particle \(P\) is initially held at \(A\) and released from rest. It subsequently performs simple harmonic motion in a straight line on the surface. After its release it is next at rest after 0.2 seconds at point \(B\) whose displacement is 0.2 m from \(A\). The point \(M\) is halfway between \(A\) and \(B\). The displacement of \(P\) from \(M\) at time \(t\) seconds after release is denoted by \(x \mathrm {~m}\).
    1. On the axes provided in the Printed Answer Booklet, sketch a graph of \(x\) against \(t\) for \(0 \leqslant t \leqslant 0.4\).
    2. Find the displacement of \(P\) from \(M\) at 0.75 seconds after release.
OCR Further Pure Core 2 2019 June Q9
11 marks Challenging +1.2
  1. Find the exact area enclosed by the curve.
  2. Show that the greatest value of \(r\) on the curve is \(\sqrt { \frac { \sqrt { 3 } } { 2 } } \mathrm { e } ^ { \frac { 1 } { 6 } }\).
OCR Further Pure Core 2 2022 June Q8
7 marks Challenging +1.2
  1. Show that \(\operatorname { Re } \left( \mathrm { e } ^ { \mathrm { Ai } \theta } \left( \mathrm { e } ^ { \mathrm { i } \theta } + \mathrm { e } ^ { - \mathrm { i } \theta } \right) ^ { 4 } \right) = a \cos 4 \theta \cos ^ { 4 } \theta\), where \(a\) is an integer to be determined.
  2. Hence show that \(\cos \frac { 1 } { 12 } \pi = \frac { 1 } { 2 } \sqrt [ 4 ] { \mathrm { b } + \mathrm { c } \sqrt { 3 } }\), where \(b\) and \(c\) are integers to be determined.
OCR Further Mechanics 2024 June Q7
14 marks Standard +0.8
  1. Show that \(B\) 's motion can be modelled by the differential equation \(\frac { 1 } { \mathrm { v } } \frac { \mathrm { dv } } { \mathrm { dx } } = - 4\).
    1. Solve the differential equation in part (a) to find the particular solution for \(v\) in terms of \(x\) and \(u\).
    2. By considering the behaviour of \(v\) as \(x \longrightarrow \infty\) describe one feature of the model that is not realistic. At the instant when \(B\) reaches the point \(A\), where \(\mathrm { x } = \mathrm { X }\), its speed is \(V \mathrm {~ms} ^ { - 1 }\). The work done by the resistance as \(B\) moves from \(O\) to \(A\) is denoted by \(W \mathrm {~J}\).
    1. Use the formula \(\mathrm { W } = \int \mathrm { F } \mathrm { dx }\) to determine an expression for \(W\) in terms of \(X\) and \(u\).
    2. Explain the relevance of the sign of your answer in part (c)(i).
    3. By writing your answer to part (c)(i) in terms of \(V\) and \(u\) show how the quantity \(W\) relates to the energy of \(B\).
OCR MEI Further Pure Core AS 2023 June Q7
10 marks Standard +0.3
  1. By expanding \(( \sqrt { 3 } + \mathrm { i } ) ^ { 5 }\), express \(z ^ { 5 }\) in the form \(\mathrm { a } +\) bi where \(a\) and \(b\) are real and exact.
    1. Express \(z\) in modulus-argument form.
    2. Hence find \(z ^ { 5 }\) in modulus-argument form.
    3. Use this result to verify your answers to part (a).
OCR MEI Further Mechanics B AS Specimen Q5
7 marks Standard +0.8
  1. Find an expression for the stiffness of the spring, \(k \mathrm { Nm } ^ { - 1 }\), in terms of \(m , h\) and \(g\). The particle is pushed down a further distance from the equilibrium position and released from rest. At time \(t\) seconds, the displacement of the particle from the equilibrium position of the system is \(y \mathrm {~m}\) in the downward direction, as shown in Fig. 5.3. You are given that \(| y | \leq h\).
  2. Show that the motion of the particle is modelled by the differential equation \(\frac { \mathrm { d } ^ { 2 } y } { \mathrm {~d} t ^ { 2 } } + \frac { g y } { h } = 0\).
  3. Find an expression for the period of the motion of the particle.
  4. Would the model for the motion of the particle be valid for large values of \(m\) ? Justify your answer.
OCR MEI Further Pure Core 2020 November Q10
7 marks Standard +0.3
  1. Write down, in exponential ( \(r \mathrm { e } ^ { \mathrm { i } \theta }\) ) form, the complex numbers represented by the points \(\mathrm { A } , \mathrm { B }\), \(\mathrm { C } , \mathrm { D } , \mathrm { E }\) and F .
  2. When these complex numbers are multiplied by the complex number \(w\), the resulting complex numbers are represented by the points G, H, I, J, K and L. Find \(w\) in exponential form.
  3. You are given that \(\mathrm { G } , \mathrm { H } , \mathrm { I } , \mathrm { J } , \mathrm { K }\) and L represent roots of the equation \(z ^ { 6 } = p\). Find \(p\).
OCR MEI Further Mechanics Major 2021 November Q10
13 marks Challenging +1.2
  1. Determine the magnitude of the normal reaction of the wire on P in terms of \(m , g , a , u\) and \(\theta\), when P is between B and C . P collides with a fixed barrier at C . The coefficient of restitution between P and the fixed barrier is \(e\). After this collision P moves back towards B . On the straight portion BA , the motion of P is resisted by a constant horizontal force \(F\).
  2. Show that P will reach A if $$F b \leqslant \frac { 1 } { 2 } m \left[ e ^ { 2 } u ^ { 2 } + k \left( 1 - e ^ { 2 } \right) g a \right] ,$$ where \(k\) is an integer to be determined.
OCR MEI Further Statistics Major 2022 June Q6
11 marks Standard +0.3
  1. Determine a 95\% confidence interval for the mean weight of liquid paraffin in a tub.
  2. Explain whether the confidence interval supports the researcher's belief.
  3. Explain why the sample has to be random in order to construct the confidence interval.
    [0pt]
  4. A 95\% confidence interval for the mean weight in grams of another ingredient in the skin cream is [1.202, 1.398]. This confidence interval is based on a large sample and the unbiased estimate of the population variance calculated from the sample is 0.25 . Find each of the following.
OCR MEI Further Extra Pure 2020 November Q5
8 marks Standard +0.3
  1. Show that \(\mathbf { f }\) is also an eigenvector of \(\mathbf { A }\).
  2. State the eigenvalue associated with \(\mathbf { f }\). You are now given that \(\mathbf { A }\) represents a reflection in 3-D space.
  3. Explain the significance of \(\mathbf { e }\) and \(\mathbf { f }\) in relation to the transformation that \(\mathbf { A }\) represents.
  4. State the cartesian equation of the plane of reflection of the transformation represented by \(\mathbf { A }\).
OCR Further Pure Core 1 2023 June Q9
14 marks Challenging +1.8
9 In this question you must show detailed reasoning.
  1. Use de Moivre's theorem to determine constants \(A\), \(B\) and \(C\) such that $$\sin ^ { 4 } \theta \equiv A \cos 4 \theta + B \cos 2 \theta + C .$$ The function f is defined by \(\mathrm { f } ( x ) = \sin \left( 4 \sin ^ { - 1 } \left( x ^ { \frac { 1 } { 5 } } \right) \right) - 8 \sin \left( 2 \sin ^ { - 1 } \left( x ^ { \frac { 1 } { 5 } } \right) \right) + 12 \sin ^ { - 1 } \left( x ^ { \frac { 1 } { 5 } } \right) , \quad x \in \mathbb { R } , 0 \leqslant x < 1\).
  2. Show that \(\mathrm { f } ^ { \prime } ( x ) = \frac { 32 } { 5 \sqrt { 1 - x ^ { \frac { 2 } { 5 } } } }\). \includegraphics[max width=\textwidth, alt={}, center]{478c66d2-16a0-41ef-9444-25cfcd47d11d-7_894_842_1000_260} The diagram shows the curve with equation \(\mathrm { y } = \frac { 1 } { \sqrt { 1 - x ^ { \frac { 2 } { 5 } } } }\) for \(0 \leqslant x < 1\) and the asymptote \(x = 1\). The region \(R\) is the unbounded region between the curve, the \(x\)-axis, the line \(x = 0\) and the line \(x = 1\). You are given that the area of \(R\) is finite.
  3. Determine the exact area of \(R\).
OCR Further Pure Core 1 2023 June Q6
4 marks Standard +0.8
6 In this question you must show detailed reasoning. The power output, \(p\) watts, of a machine at time \(t\) hours after it is switched on can be modelled by the equation \(\mathrm { p } = 20 - 20 \tanh ( 1.44 \mathrm { t } )\) for \(t \geqslant 0\). Determine, according to the model, the mean power output of the machine over the first half hour after it is switched on. Give your answer correct to \(\mathbf { 2 }\) decimal places.
OCR D2 2007 January Q6
12 marks Moderate -0.5
6 Answer this question on the insert provided. The table shows a partially completed dynamic programming tabulation for solving a maximin problem.
StageStateActionWorkingMaximin
\multirow{2}{*}{1}0044
1033
\multirow{6}{*}{2}00\(\min ( 6,4 ) = 4\)\multirow{2}{*}{}
1\(\min ( 2,3 ) = 2\)
\multirow{2}{*}{1}0\(\min ( 2,4 ) =\)\multirow{2}{*}{}
1\(\min ( 4,3 ) =\)
\multirow{2}{*}{2}0min(2,\multirow{2}{*}{}
1min(3,
\multirow{3}{*}{3}\multirow{3}{*}{0}0min(5,\multirow{3}{*}{}
1\(\min ( 5\),
2\(\min ( 2\),
  1. Complete the last two columns of the table in the insert.
  2. State the maximin value and write down the maximin route.
OCR MEI Further Pure Core AS 2024 June Q4
7 marks Standard +0.8
4 In this question you must show detailed reasoning. The roots of the cubic equation \(x ^ { 3 } - 3 x ^ { 2 } + 19 x - 17 = 0\) are \(\alpha , \beta\) and \(\gamma\).
  1. Find a cubic equation with integer coefficients whose roots are \(\frac { 1 } { 2 } ( \alpha - 1 ) , \frac { 1 } { 2 } ( \beta - 1 )\) and \(\frac { 1 } { 2 } ( \gamma - 1 )\).
  2. Hence or otherwise solve the equation \(x ^ { 3 } - 3 x ^ { 2 } + 19 x - 17 = 0\).
OCR MEI Further Pure Core AS 2024 June Q9
8 marks Challenging +1.2
9 In this question you must show detailed reasoning. Find a vector \(\mathbf { v }\) which has the following properties.
  • It is a unit vector.
  • It is parallel to the plane \(2 x + 2 y + z = 10\).
  • It makes an angle of \(45 ^ { \circ }\) with the normal to the plane \(\mathrm { x } + \mathrm { z } = 5\).
\section*{END OF QUESTION PAPER} }{www.ocr.org.uk}) after the live examination series.
If OCR has unwittingly failed to correctly acknowledge or clear any third-party content in this assessment material, OCR will be happy to correct its mistake at the earliest possible opportunity.
For queries or further information please contact The OCR Copyright Team, The Triangle Building, Shaftesbury Road, Cambridge CB2 8EA.
OCR is part of Cambridge University Press \& Assessment, which is itself a department of the University of Cambridge.
OCR D1 2006 January Q1
5 marks Easy -1.2
1 Answer this question on the insert provided.
\includegraphics[max width=\textwidth, alt={}]{8f17020a-14bf-4459-9241-1807b954a629-2_956_1203_349_493}
This diagram shows a network. The insert has a copy of this network together with a list of the arcs, sorted into increasing order of weight. Use Kruskal's algorithm on the insert to find a minimum spanning tree for this network. Draw your tree and give its total weight.
OCR D1 2006 January Q2
6 marks Moderate -0.8
2 Answer this question on the insert provided.
\includegraphics[max width=\textwidth, alt={}]{8f17020a-14bf-4459-9241-1807b954a629-2_659_1136_1720_530}
This diagram shows part of a network. There are other arcs connecting \(D\) and \(E\) to other parts of the network. Apply Dijkstra's algorithm starting from \(A\), as far as you are able, showing your working. Note: you will not be able to give permanent labels to all the vertices shown.
OCR D1 2007 January Q5
16 marks Moderate -0.3
5 Answer part (i) of this question on the insert provided. Rhoda Raygh enjoys driving but gets extremely irritated by speed cameras.
The network represents a simplified map on which the arcs represent roads and the weights on the arcs represent the numbers of speed cameras on the roads. The sum of the weights on the arcs is 72 . \includegraphics[max width=\textwidth, alt={}, center]{8a1232ae-6a6e-4afb-8757-fffe4fc9570f-05_874_1484_664_333}
  1. Rhoda lives at Ayton ( \(A\) ) and works at Kayton ( \(K\) ). Use Dijkstra's algorithm on the diagram in the insert to find the route from \(A\) to \(K\) that involves the least number of speed cameras and state the number of speed cameras on this route.
  2. In her job Rhoda has to drive along each of the roads represented on the network to check for overhanging trees. This requires finding a route that covers every arc at least once, starting and ending at Kayton (K). Showing all your working, find a suitable route for Rhoda that involves the least number of speed cameras and state the number of speed cameras on this route.
  3. If Rhoda checks the roads for overhanging trees on her way home, she will instead need a route that covers every arc at least once, starting at Kayton and ending at Ayton. Calculate the least number of speed cameras on such a route, explaining your reasoning.
OCR D1 2009 January Q3
23 marks Moderate -0.3
3 Answer this question on the insert provided. \includegraphics[max width=\textwidth, alt={}, center]{43fe5fd5-4b98-4c3a-90ca-a1bd5cf065fe-3_492_1006_356_568}
  1. This diagram shows a network. The insert has a copy of this network together with a list of the arcs, sorted into increasing order of weight. Use Kruskal's algorithm on the insert to find a minimum spanning tree for this network. Draw your tree and give its total weight.
  2. Use your answer to part (i) to find the weight of a minimum spanning tree for the network with vertex \(E\), and all the arcs joined to \(E\), removed. Hence find a lower bound for the travelling salesperson problem on the original network.
  3. Show that the nearest neighbour method, starting from vertex \(A\), fails on the original network.
  4. Apply the nearest neighbour method, starting from vertex \(B\), to find an upper bound for the travelling salesperson problem on the original network.
  5. Apply Dijkstra's algorithm to the copy of the network in the insert to find the least weight path from \(A\) to \(G\). State the weight of the path and give its route.
  6. The sum of the weights of all the arcs is 300 . Apply the route inspection algorithm, showing all your working, to find the weight of the least weight closed route that uses every arc at least once. The weights of least weight paths from vertex \(A\) should be found using your answer to part (v); the weights of other such paths should be determined by inspection.
OCR D1 2009 January Q4
12 marks Easy -1.2
4 Answer this question on the insert provided. The list of numbers below is to be sorted into decreasing order using shuttle sort. $$\begin{array} { l l l l l l l l l } 21 & 76 & 65 & 13 & 88 & 62 & 67 & 28 & 34 \end{array}$$
  1. How many passes through shuttle sort will be required to sort the list? After the first pass the list is as follows. $$\begin{array} { l l l l l l l l l } 76 & 21 & 65 & 13 & 88 & 62 & 67 & 28 & 34 \end{array}$$
  2. State the number of comparisons and the number of swaps that were made in the first pass.
  3. Write down the list after the second pass. State the number of comparisons and the number of swaps that were used in making the second pass.
  4. Complete the table in the insert to show the results of the remaining passes, recording the number of comparisons and the number of swaps made in each pass. You may not need all the rows of boxes printed. When the original list is sorted into decreasing order using bubble sort there are 30 comparisons and 17 swaps.
  5. Use your results from part (iv) to compare the efficiency of these two methods in this case. Katie makes and sells cookies. Each batch of plain cookies takes 8 minutes to prepare and then 12 minutes to bake. Each batch of chocolate chip cookies takes 12 minutes to prepare and then 12 minutes to bake. Each batch of fruit cookies takes 10 minutes to prepare and then 12 minutes to bake. Katie can only bake one batch at a time. She has the use of the kitchen, including the oven, for at most 1 hour.
    [0pt]
  1. Each batch of cookies must be prepared before it is baked. By considering the maximum time available for baking the cookies, explain why Katie can make at most 4 batches of cookies. [2] Katie models the constraints as $$\begin{gathered} x + y + z \leqslant 4 \\ 4 x + 6 y + 5 z \leqslant 24 \\ x \geqslant 0 , y \geqslant 0 , z \geqslant 0 \end{gathered}$$ where \(x\) is the number of batches of plain cookies, \(y\) is the number of batches of chocolate chip cookies and \(z\) is the number of batches of fruit cookies that Katie makes.
  2. Each batch of cookies that Katie prepares must be baked within the hour available. By considering the maximum time available for preparing the cookies, show how the constraint \(4 x + 6 y + 5 z \leqslant 24\) was formed.
  3. In addition to the constraints, what other restriction is there on the values of \(x , y\) and \(z\) ? Katie will make \(\pounds 5\) profit on each batch of plain cookies, \(\pounds 4\) on each batch of chocolate chip cookies and \(\pounds 3\) on each batch of fruit cookies that she sells. Katie wants to maximise her profit.
  4. Write down an expression for the objective function to be maximised. State any assumption that you have made.
  5. Represent Katie's problem as an initial Simplex tableau. Perform one iteration of the Simplex algorithm, choosing to pivot on an element from the \(x\)-column. Show how each row was obtained. Write down the number of batches of cookies of each type and the profit at this stage. After carrying out market research, Katie decides that she will not make fruit cookies. She also decides that she will make at least twice as many batches of chocolate chip cookies as plain cookies.
  6. Represent the constraints for Katie's new problem graphically and calculate the coordinates of the vertices of the feasible region. By testing suitable integer-valued coordinates, find how many batches of plain cookies and how many batches of chocolate chip cookies Katie should make to maximise her profit. Show your working.
OCR D1 2010 January Q1
11 marks Standard +0.3
1 Answer this question on the insert provided. \includegraphics[max width=\textwidth, alt={}, center]{e1495f6b-c09f-46a1-a6f8-02354e28887a-02_533_1353_342_395}
  1. Apply Dijkstra's algorithm to the copy of this network in the insert to find the least weight path from \(A\) to \(F\). State the route of the path and give its weight.
  2. Apply the route inspection algorithm, showing all your working, to find the weight of the least weight closed route that uses every arc at least once. Write down a closed route that has this least weight. An extra arc is added, joining \(B\) to \(E\), with weight 2 .
  3. Write down the new least weight path from \(A\) to \(F\). Explain why the new least weight closed route, that uses every arc at least once, has no repeated arcs.
OCR D1 2007 June Q5
16 marks Standard +0.3
5 Answer this question on the insert provided. The network below represents a simplified map of a building. The arcs represent corridors and the weights on the arcs represent the lengths of the corridors, in metres. The sum of the weights on the arcs is 765 metres. \includegraphics[max width=\textwidth, alt={}, center]{dbf782dd-879c-4f0f-b532-246a0db9f130-5_1271_1539_584_303}
  1. Janice is the cleaning supervisor in the building. She is at the position marked as J when she is called to attend a cleaning emergency at B. On the network in the insert, use Dijkstra's algorithm, starting from vertex J and continuing until B is given a permanent label, to find the shortest path from J to B and the length of this path.
  2. In her job J anice has to walk along each of the corridors represented on the network. This requires finding a route that covers every arc at least once, starting and ending at J. Showing all your working, find the shortest distance that J anice must walk to check all the corridors. The labelled vertices represent 'cleaning stations'. J anice wants to visit every cleaning station using the shortest possible route. She produces a simplified network with no repeated arcs and no arc that joins a vertex to itself.
  3. On the insert, complete Janice's simplified network. Which standard network problem does Janice need to solve to find the shortest distance that she must travel?
OCR D1 2007 June Q6
13 marks Moderate -0.5
6 Answer this question on the insert provided. The table shows the distances, in miles, along the direct roads between six villages, \(A\) to \(F\). A dash ( - ) indicates that there is no direct road linking the villages.
ABCDEF
A-63---
B6-56-14
C35-8410
D-68-38
E--43--
F-14108--
  1. On the table in the insert, use Prim's algorithm to find a minimum spanning tree. Start by crossing out row A. Show which entries in the table are chosen and indicate the order in which the rows are deleted. Draw your minimum spanning tree and state its total weight.
  2. By deleting vertex B and the arcs joined to vertex B, calculate a lower bound for the length of the shortest cycle through all the vertices.
  3. A pply the nearest neighbour method to the table above, starting from \(F\), to find a cycle that passes through every vertex and use this to write down an upper bound for the length of the shortest cycle through all the vertices.
    {}