Questions — OCR MEI (4333 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 Mechanics 1 P1 P2 P3 P4 PMT Mocks PURE Paper 1 Paper 2 Paper 3 Pure 1 S1 S2 S3 S4 Stats 1 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 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 Mechanics 1 PURE Pure 1 S1 S2 S3 S4 Stats 1 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 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 MEI D1 2008 January Q6
16 marks Easy -1.2
6 The diagram shows routes between points in a town. The distances are in kilometres. \includegraphics[max width=\textwidth, alt={}, center]{dfe6db33-33d0-4dff-95f7-fbf097e3963e-6_817_1219_319_422}
  1. Use an appropriate algorithm to find a set of connecting arcs of minimum total length. Indicate your connecting arcs on the copy of the diagram in your answer book, and give their total length.
  2. Give the name of the algorithm you have used, and describe it briefly.
  3. Using the second diagram in your answer book, apply Dijkstra's algorithm to find the shortest distances from A to each of the other points. List the connections that are used, and give their total length.
OCR MEI D1 2009 January Q1
8 marks
1 Alfred, Ben, Charles and David meet, and some handshaking takes place.
  • Alfred shakes hands with David.
  • Ben shakes hands with Charles and David.
  • Charles shakes hands with Ben and David.
    1. Complete the bipartite graph in your answer book showing A (Alfred), B (Ben), C (Charles) and D (David), and the number of people each shakes hands with.
    2. Explain why, whatever handshaking takes place, the resulting bipartite graph cannot contain both an arc terminating at 0 and another arc terminating at 3 .
    3. Explain why, whatever number of people meet, and whatever handshaking takes place, there must always be two people who shake hands with the same number of people.
OCR MEI D1 2009 January Q2
8 marks Moderate -0.8
2 The following algorithm computes the number of comparisons made when Prim’s algorithm is applied to a complete network on \(n\) vertices ( \(n > 2\) ). Step 1 Input the value of \(n\) Step 2 Let \(i = 1\) Step 3 Let \(j = n - 2\) Step 4 Let \(k = j\) Step 5 Let \(i = i + 1\) Step 6 Let \(j = j - 1\) Step 7 Let \(k = k + ( i \times j ) + ( i - 1 )\) Step 8 If \(j > 0\) then go to Step 5
Step 9 Print \(k\) Step 10 Stop
  1. Apply the algorithm when \(n = 5\), showing the intermediate values of \(i , j\) and \(k\). The function \(\mathrm { f } ( n ) = \frac { 1 } { 6 } n ^ { 3 } - \frac { 7 } { 6 } n + 1\) gives the same output as the algorithm.
  2. Showing your working, check that \(\mathrm { f } ( 5 )\) is the same value as your answer to part (i).
  3. What does the structure of \(\mathrm { f } ( n )\) tell you about Prim's algorithm?
OCR MEI D1 2009 January Q3
8 marks Moderate -0.5
3 Whilst waiting for her meal to be served, Alice tries to construct a network to represent the meals offered in the restaurant. \includegraphics[max width=\textwidth, alt={}, center]{9bb2d545-3764-4930-a8a8-9dc5e25d0836-3_684_1310_365_379}
  1. Use Dijkstra's algorithm to find the cheapest route through the undirected network from "start" to "end". Give the cost and describe the route. Use the lettering given on the network in your answer book.
  2. Criticise the model and suggest how it might be improved.
OCR MEI D1 2009 January Q4
16 marks Moderate -0.8
4 A ski-lift gondola can carry 4 people. The weight restriction sign in the gondola says "4 people - 325 kg ". The table models the distribution of weights of people using the gondola.
\cline { 2 - 4 } \multicolumn{1}{c|}{}MenWomenChildren
Weight \(( \mathrm { kg } )\)908040
Probability\(\frac { 1 } { 2 }\)\(\frac { 1 } { 3 }\)\(\frac { 1 } { 6 }\)
  1. Give an efficient rule for using 2-digit random numbers to simulate the weight of a person entering the gondola.
  2. Give a reason for using 2-digit rather than 1-digit random numbers in these circumstances.
  3. Using the random numbers given in your answer book, simulate the weights of four people entering the gondola, and hence give its simulated load.
  4. Using the random numbers given in your answer book, repeat your simulation 9 further times. Hence estimate the probability of the load of a fully-laden gondola exceeding 325 kg .
  5. What in reality might affect the pattern of loading of a gondola which is not modelled by your simulation?
OCR MEI D1 2009 January Q5
16 marks Moderate -0.8
5 The tasks involved in turning around an "AirGB" aircraft for its return flight are listed in the table. The table gives the durations of the tasks and their immediate predecessors.
ActivityDuration (mins)Immediate Predecessors
A Refuel30-
B Clean cabin25-
C Pre-flight technical check15A
D Load luggage20-
E Load passengers25A, B
F Safety demonstration5E
G Obtain air traffic clearance10C
H Taxi to runway5G, D
  1. Draw an activity on arc network for these activities.
  2. Mark on your diagram the early time and the late time for each event. Give the minimum completion time and the critical activities. Because of delays on the outbound flight the aircraft has to be turned around within 50 minutes, so as not to lose its air traffic slot for the return journey. There are four tasks on which time can be saved. These, together with associated costs, are listed below.
    TaskABDE
    New time (mins)20201515
    Extra cost2505050100
  3. List the activities which need to be speeded up in order to turn the aircraft around within 50 minutes at minimum extra cost. Give the extra cost and the new set of critical activities.
OCR MEI D1 2009 January Q6
16 marks Standard +0.8
6 A company is planning its production of "MPowder" for the next three months.
  • Over the next 3 months 20 tonnes must be produced.
  • Production quantities must not be decreasing. The amount produced in month 2 cannot be less than the amount produced in month 1 , and the amount produced in month 3 cannot be less than the amount produced in month 2.
  • No more than 12 tonnes can be produced in total in months 1 and 2.
  • Production costs are \(\pounds 2000\) per tonne in month \(1 , \pounds 2200\) per tonne in month 2 and \(\pounds 2500\) per tonne in month 3.
The company planner starts to formulate an LP to find a production plan which minimises the cost of production: $$\begin{array} { l l } \text { Minimise } & 2000 x _ { 1 } + 2200 x _ { 2 } + 2500 x _ { 3 } \\ \text { subject to } & x _ { 1 } \geq 0 x _ { 2 } \geq 0 x _ { 3 } \geq 0 \\ & x _ { 1 } + x _ { 2 } + x _ { 3 } = 20 \\ & x _ { 1 } \leq x _ { 2 } \\ & \bullet \cdot \cdot \end{array}$$
  1. Explain what the variables \(x _ { 1 } , x _ { 2 }\) and \(x _ { 3 }\) represent, and write down two more constraints to complete the formulation.
  2. Explain how the LP can be reformulated to: $$\begin{array} { l l } \text { Maximise } & 500 x _ { 1 } + 300 x _ { 2 } \\ \text { subject to } & x _ { 1 } \geq 0 x _ { 2 } \geq 0 \\ & x _ { 1 } \leq x _ { 2 } \\ & x _ { 1 } + 2 x _ { 2 } \leq 20 \\ & x _ { 1 } + x _ { 2 } \leq 12 \end{array}$$
  3. Use a graphical approach to solve the LP in part (ii). Interpret your solution in terms of the company's production plan, and give the minimum cost.
OCR MEI D1 2010 January Q1
8 marks Easy -1.2
1 The table shows the activities involved in a project, their durations and their precedences.
ActivityDuration (mins)Immediate predecessors
A3-
B2-
C3A
D5A, B
E1C
  1. Draw an activity on arc network for these activities.
  2. Mark on your diagram the early time and the late time for each event. Give the critical activities.
OCR MEI D1 2010 January Q2
8 marks Standard +0.8
2 The vertices of a graph are to be coloured using the following rules:
  • all vertices are to be coloured
  • no two vertices joined by an edge are to have the same colour.
The following graph has been coloured with four colours. \includegraphics[max width=\textwidth, alt={}, center]{71ca9c4e-573b-43b7-910d-4bd610af6b27-2_357_883_1683_591} Kempe's rule allows for colours to be swapped. The rule is:
  • choose two colours
  • draw the subgraph consisting of the vertices coloured with these two colours, together with the edges that connect them
  • in any connected part of this subgraph consisting of two or more vertices, the two colours can be swapped.
    1. Use Kempe's rule, choosing the colours blue and red.
Show that the graph can then be coloured with two colours.
  • Why does Kempe's rule not constitute an algorithm for colouring graphs?
    •
    OCR MEI D1 2010 January Q3
    8 marks Easy -1.8
    3 Consider the following graph in which the arcs are straight lines. \includegraphics[max width=\textwidth, alt={}, center]{71ca9c4e-573b-43b7-910d-4bd610af6b27-3_928_938_317_566}
    1. Explain how you know that the graph is simple.
    2. Explain how you know that the graph is not connected.
    3. On the copy of the graph in your answer book, add as many arcs as you can whilst keeping it both simple and not connected. Give the number of arcs which you have added.
    4. Imagine that a new graph is produced in which two vertices are connected if there is no connection between them, direct or indirect, on the original graph. How many arcs would this new graph have?
    OCR MEI D1 2010 January Q4
    16 marks Standard +0.3
    4 An air charter company has the following rules for selling seats on a flight.
    1. The total number of seats sold must not exceed 120.
    2. There must be at least 100 seats sold, or the flight will be cancelled.
    3. For every child seat sold there must be a seat sold for a supervising adult.
      1. Define two variables so that the three constraints can be formulated in terms of your variables. Formulate the three constraints in terms of your variables.
      2. Graph your three inequalities from part (i).
      The price for a child seat is \(\pounds 50\) and the price for an adult seat is \(\pounds 100\).
    4. Find the maximum income available from the flight, and mark and label the corresponding point on your graph.
    5. Find the minimum income available from a full plane, and mark and label the corresponding point on your graph.
    6. Find the minimum income available from the flight, and mark and label the corresponding point on your graph.
    7. At \(\pounds 100\) for an adult seat and \(\pounds 50\) for a child seat the company would prefer to sell 100 adult seats and no child seats rather than have a full plane with 60 adults and 60 children. What would be the minimum price for a child's seat for that not to be the case, given that the adult seat price remains at \(\pounds 100\) ?
    OCR MEI D1 2010 January Q5
    16 marks Standard +0.3
    5 The matrix shows the distances in miles between towns where direct routes exist.
    ABCDEF
    A-22-1210-
    B22----13
    C---6511
    D12-6---
    E10-5--26
    F-1311-26-
    1. Draw the network.
    2. Use Dijkstra's algorithm to find the shortest route from A to F . Give the route and its length.
    3. Use Kruskal's algorithm to find a minimum connector for the network, showing your working. Draw your connector and give its total length.
    4. How much shorter would AD have to be if it were to be included in
      (A) a shortest route from A to F ,
      (B) a minimum connector?
    OCR MEI D1 2010 January Q6
    16 marks Moderate -0.8
    6 An apple tree has 6 apples left on it. Each day each remaining apple has a probability of \(\frac { 1 } { 3 }\) of falling off the tree during the day.
    1. Give a rule for using one-digit random numbers to simulate whether or not a particular apple falls off the tree during a given day.
    2. Use the random digits given in your answer book to simulate how many apples fall off the tree during day 1 . Give the total number of apples that fall during day 1 .
    3. Continue your simulation from the end of day 1 , which you simulated in part (ii), for successive days until there are no apples left on the tree. Use the same list of random digits, continuing from where you left off in part (ii). During which day does the last apple fall from the tree? Now suppose that at the start of each day the gardener picks one apple from the tree and eats it.
    4. Repeat your simulation with the gardener picking the lowest numbered apple remaining on the tree at the start of each day. Give the day during which the last apple falls or is picked. Use the same string of random digits, a copy of which is provided for your use in this part of the question.
    5. How could your results be made more reliable?
    OCR MEI D1 2011 January Q1
    8 marks Moderate -0.8
    1 The diagram shows an electrical circuit with wires and switches and with five components, labelled A, B, C, D and E. \includegraphics[max width=\textwidth, alt={}, center]{11c2d98f-1f72-4f1b-b971-5521bee09358-2_328_730_609_319} \includegraphics[max width=\textwidth, alt={}, center]{11c2d98f-1f72-4f1b-b971-5521bee09358-2_261_519_621_1224}
    1. Draw a graph showing which vertices are connected together, either directly or indirectly, when the two switches remain open.
    2. How many arcs need to be added to your graph when both switches are closed? The graph below shows which components are connected to each other, either directly or indirectly, for a second electrical circuit. \includegraphics[max width=\textwidth, alt={}, center]{11c2d98f-1f72-4f1b-b971-5521bee09358-2_410_494_1356_788}
    3. Find the minimum number of arcs which need to be deleted to create two disconnected sets of vertices, and write down your two separate sets.
    4. Explain why, in the second electrical circuit, it might be possible to split the components into two disconnected sets by cutting fewer wires than the number of arcs which were deleted in part (iii).
    OCR MEI D1 2011 January Q2
    8 marks Moderate -0.5
    2 King Elyias has been presented with eight flagons of fine wine. Intelligence reports indicate that at least one of the eight flagons has been poisoned. King Elyias will have the wine tasted by the royal wine tasters to establish which flagons are poisoned. Samples for testing are made by using wine from one or more flagons. If a royal wine taster tastes a sample of wine which includes wine from a poisoned flagon, the taster will die. The king has to make a very generous payment for each sample tasted. To minimise payments, the royal mathematicians have devised the following scheme:
    Test a sample made by mixing wine from flagons \(1,2,3\) and 4.
    If the taster dies, then test a sample made by mixing wine from flagons \(5,6,7\) and 8 .
    If the taster lives, then there is no poison in flagons \(1,2,3\) or 4 . So there is poison in at least one of flagons 5, 6, 7 and 8, and there is no need to test a sample made by mixing wine from all four of them. If the sample from flagons \(1,2,3\) and 4 contains poison, then test a fresh sample made by mixing wine from flagons 1 and 2, and proceed similarly, testing a sample from flagons 3 and 4 only if the taster of the sample from flagons 1 and 2 dies. Continue, testing new samples made from wine drawn from half of the flagons corresponding to a poisoned sample, and testing only when necessary.
    1. Record what happens using the mathematicians' scheme when flagon number 7 is poisoned, and no others.
    2. Record what happens using the mathematicians' scheme when two flagons, numbers 3 and 7, are poisoned.
    OCR MEI D1 2011 January Q3
    8 marks Moderate -0.8
    3 The network shows distances between vertices where direct connections exist. \includegraphics[max width=\textwidth, alt={}, center]{11c2d98f-1f72-4f1b-b971-5521bee09358-3_518_691_1742_687}
    1. Use Dijkstra's algorithm to find the shortest distance and route from A to F .
    2. Explain why your solution to part (i) also provides the shortest distances and routes from A to each of the other vertices.
      [0pt]
    3. Explain why your solution to part (i) also provides the shortest distance and route from B to F. [1]
    OCR MEI D1 2011 January Q4
    16 marks Moderate -0.5
    4 The table shows the tasks involved in preparing breakfast, and their durations.
    TaskDescriptionDuration (mins)
    AFill kettle and switch on0.5
    BBoil kettle1.5
    CCut bread and put in toaster0.5
    DToast bread2
    EPut eggs in pan of water and light gas1
    FBoil eggs5
    GPut tablecloth, cutlery and crockery on table2.5
    HMake tea and put on table0.5
    ICollect toast and put on table0.5
    JPut eggs in cups and put on table1
    1. Show the immediate predecessors for each of these tasks.
    2. Draw an activity on arc network modelling your precedences.
    3. Perform a forward pass and a backward pass to find the early time and the late time for each event.
    4. Give the critical activities, the project duration, and the total float for each activity.
    5. Given that only one person is available to do these tasks, and noting that tasks B, D and F do not require that person's attention, produce a cascade chart showing how breakfast can be prepared in the least possible time.
    OCR MEI D1 2011 January Q5
    16 marks Moderate -0.8
    5 Viola and Orsino are arguing about which striker to include in their fantasy football team. Viola prefers Rocinate, who creates lots of goal chances, but is less good at converting them into goals. Orsino prefers Quince, who is not so good at creating goal chances, but who is better at converting them into goals. The information for Rocinate and Quince is shown in the tables.
    \multirow{2}{*}{}Number of chances created per match
    RocinateQuince
    Number67895678
    Probability\(\frac { 1 } { 20 }\)\(\frac { 1 } { 4 }\)\(\frac { 1 } { 2 }\)\(\frac { 1 } { 5 }\)\(\frac { 1 } { 3 }\)\(\frac { 1 } { 3 }\)\(\frac { 1 } { 6 }\)\(\frac { 1 } { 6 }\)
    Probability of converting a chance into a goal
    RocinateQuince
    0.10.12
    1. Give an efficient rule for using 2-digit random numbers to simulate the number of chances created by Rocinate in a match.
    2. Give a rule for using 2-digit random numbers to simulate the conversion of chances into goals by Rocinate.
    3. Your Printed Answer Book shows the result of simulating the number of goals scored by Rocinate in nine matches. Use the random numbers given to complete the tenth simulation, showing which of your simulated chances are converted into goals.
    4. Give an efficient rule for using 2-digit random numbers to simulate the number of chances created by Quince in a match.
    5. Your Printed Answer Book shows the result of simulating the number of goals scored by Quince in nine matches. Use the random numbers given to complete the tenth simulation, showing which of your simulated chances are converted into goals.
    6. Which striker, if any, is favoured by the simulation? Justify your answer.
    7. How could the reliability of the simulation be improved?
    OCR MEI D1 2011 January Q6
    16 marks Moderate -0.8
    6 A manufacturing company holds stocks of two liquid chemicals. The company needs to update its stock levels. The company has 2000 litres of chemical A and 4000 litres of chemical B currently in stock. Its storage facility allows for no more than a combined total of 12000 litres of the two chemicals. Chemical A is valued at \(\pounds 5\) per litre and chemical B is valued at \(\pounds 6\) per litre. The company intends to hold stocks of these two chemicals with a total value of at least \(\pounds 61000\). Let \(a\) be the increase in the stock level of A, in thousands of litres ( \(a\) can be negative).
    Let \(b\) be the increase in the stock level of B , in thousands of litres ( \(b\) can be negative).
    1. Explain why \(a \geqslant - 2\), and produce a similar inequality for \(b\).
    2. Explain why the value constraint can be written as \(5 a + 6 b \geqslant 27\), and produce, in similar form, the storage constraint.
    3. Illustrate all four inequalities graphically.
    4. Find the policy which will give a stock value of exactly \(\pounds 61000\), and will use all 12000 litres of available storage space.
    5. Interpret your solution in terms of stock levels, and verify that the new stock levels do satisfy both the value constraint and the storage constraint.
    OCR MEI D1 2012 January Q1
    8 marks Moderate -0.5
    1 A graph is obtained from a solid by producing a vertex for each exterior face. Vertices in the graph are connected if their corresponding faces in the original solid share an edge. The diagram shows a solid followed by its graph. The solid is made up of two cubes stacked one on top of the other. This solid has 10 exterior faces, which correspond to the 10 vertices in the graph. (Note that in this question it is the exterior faces of the cubes that are being counted.) \includegraphics[max width=\textwidth, alt={}, center]{3239d012-5699-4789-ba64-f1295f4b4642-2_455_309_571_653} \includegraphics[max width=\textwidth, alt={}, center]{3239d012-5699-4789-ba64-f1295f4b4642-2_444_286_573_1135}
    1. Draw the graph for a cube.
    2. Obtain the number of vertices and the number of edges for the graph of three cubes stacked on top of each other. \includegraphics[max width=\textwidth, alt={}, center]{3239d012-5699-4789-ba64-f1295f4b4642-2_643_305_1302_881}
    OCR MEI D1 2012 January Q2
    8 marks Easy -1.8
    2 The following is called the '1089' algorithm. In steps 1 to 4 numbers are to be written with exactly three digits; for example 42 is written as 042. Step 1 Choose a 3-digit number, with no digit being repeated.
    Step 2 Form a new number by reversing the order of the three digits.
    Step 3 Subtract the smaller number from the larger and call the difference D. If the two numbers are the same then \(\mathrm { D } = 000\). Step 4 Form a new number by reversing the order of the three digits of D , and call it R .
    Step 5 Find the sum of D and R .
    1. Apply the algorithm, choosing 427 for your 3-digit number, and showing all of the steps.
    2. Apply the algorithm to a 3-digit number of your choice, showing all of the steps.
    3. Investigate what happens if digits may be repeated in the 3 -digit number in step 1 .
    OCR MEI D1 2012 January Q3
    8 marks Moderate -0.8
    3 Solve the following LP problem graphically.
    Maximise \(2 x + 3 y\) subject to \(\quad x + y \leqslant 11\) $$\begin{aligned} 3 x + 5 y & \leqslant 39 \\ x + 6 y & \leqslant 39 . \end{aligned}$$
    OCR MEI D1 2012 January Q4
    16 marks Moderate -0.3
    4 The table defines a network in which the numbers represent lengths.
    ABCDEFG
    A-523---
    B5---11-
    C2---41-
    D3---42-
    E-144--1
    F-112--5
    G----15-
    1. Draw the network.
    2. Use Dijkstra's algorithm to find the shortest paths from A to each of the other vertices. Give the paths and their lengths.
    3. Draw a new network containing all of the edges in your shortest paths, and find the total length of the edges in this network.
    4. Find a minimum connector for the original network, draw it, and give the total length of its edges.
    5. Explain why the method defined by parts (i), (ii) and (iii) does not always give a minimum connector.
    OCR MEI D1 2012 January Q5
    16 marks Easy -1.8
    5 Five gifts are to be distributed among five people, A, B, C, D and E. The gifts are labelled from 1 to 5. Each gift is allocated randomly to one of the five people. A person can receive more than one gift.
    1. Use one-digit random numbers to simulate this process. One-digit random numbers are provided in your answer book. Explain how your simulation works. Produce a table, showing how many gifts each person receives.
    2. Carry out four more simulations showing, in each case, how many gifts each person receives.
    3. Use your simulation to estimate the probabilities of a person receiving \(0,1,2,3,4\) and 5 gifts.
    4. Describe what you would have to do differently if there were six people and six gifts.
    OCR MEI D1 2012 January Q6
    16 marks Moderate -0.8
    6 The table shows the tasks involved in making a salad, their durations and their precedences.
    TaskDuration (seconds)Immediate predecessors
    Bget out bowl and implements10-
    Iget out ingredients10-
    Lchop lettuce15B, I
    Wwash tomatoes and celery25B, I
    Tchop tomatoes15W
    Cchop celery10W
    Ppeel apple20B, I
    Achop apple10P
    Ddress salad10L, T, C, A
    1. Draw an activity on arc network for these activities.
    2. Mark on your diagram the early and late times for each event. Give the minimum completion time and the critical activities.
    3. Given that each task can only be done by one person, how many people are needed to prepare the salad in the minimum time? What is the minimum time required to prepare the salad if only one person is available?
    4. Show how two people can prepare the salad as quickly as possible.