Questions D1 - A-Level Maths

Apply the algorithm, choosing 427 for your 3-digit number, and showing all of the steps.
Apply the algorithm to a 3-digit number of your choice, showing all of the steps.
Investigate what happens if digits may be repeated in the 3 -digit number in step 1 .

OCR MEI D1 2012 January Q3

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

4 The table defines a network in which the numbers represent lengths.

	A	B	C	D	E	F	G
A	-	5	2	3	-	-	-
B	5	-	-	-	1	1	-
C	2	-	-	-	4	1	-
D	3	-	-	-	4	2	-
E	-	1	4	4	-	-	1
F	-	1	1	2	-	-	5
G	-	-	-	-	1	5	-

Draw the network.
Use Dijkstra's algorithm to find the shortest paths from A to each of the other vertices. Give the paths and their lengths.
Draw a new network containing all of the edges in your shortest paths, and find the total length of the edges in this network.
Find a minimum connector for the original network, draw it, and give the total length of its edges.
Explain why the method defined by parts (i), (ii) and (iii) does not always give a minimum connector.

OCR MEI D1 2012 January Q5

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.

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.
Carry out four more simulations showing, in each case, how many gifts each person receives.
Use your simulation to estimate the probabilities of a person receiving $0,1,2,3,4$ and 5 gifts.
Describe what you would have to do differently if there were six people and six gifts.

OCR MEI D1 2012 January Q6

6 The table shows the tasks involved in making a salad, their durations and their precedences.

Task		Duration (seconds)	Immediate predecessors
B	get out bowl and implements	10	-
I	get out ingredients	10	-
L	chop lettuce	15	B, I
W	wash tomatoes and celery	25	B, I
T	chop tomatoes	15	W
C	chop celery	10	W
P	peel apple	20	B, I
A	chop apple	10	P
D	dress salad	10	L, T, C, A

Draw an activity on arc network for these activities.
Mark on your diagram the early and late times for each event. Give the minimum completion time and the critical activities.
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?
Show how two people can prepare the salad as quickly as possible.

OCR MEI D1 2013 January Q1

1 The weights on the arcs in the network represent times in minutes to travel between vertices.
\includegraphics[max width=\textwidth, alt={}, center]{d1e0f047-6484-435b-a685-2cbbf81a6b02-2_606_782_402_628}

Use Dijkstra's algorithm to find the fastest route from A to F . Give the route and the time.
Use an algorithm to find the minimum connector for the network, showing your working. Find the minimum time to travel from A to F using only arcs in the minimum connector.

OCR MEI D1 2013 January Q2

2 A small party is held in a country house. There are 10 men and 10 women, and there are 10 dances. For each dance a number of pairings, each of one man and one woman, are formed. The same pairing can appear in more than one dance. A graph is to be drawn showing who danced with whom during the evening, ignoring repetitions.

Name the type of graph which is appropriate.
What is the maximum possible number of arcs in the graph? Dashing Mr Darcy dances with every woman except Elizabeth, who will have nothing to do with him. She dances with eight different men. Prince Charming only dances with Cinderella. Cinderella only dances with Prince Charming and with Mr Darcy. The three ugly sisters only have one dance each.
Add arcs to the graph in your answer book to show this information.
What is the maximum possible number of arcs in the graph?

OCR MEI D1 2013 January Q3

3 The following algorithm computes an estimate of the square root of a number which is between 0 and 2.
Step 1 Subtract 1 from the number and call the result $x$
Step 2 Set oldr = 1
Step 3 Set $i = 1$
Step 4 Set $j = 0.5$
Step 5 Set $k = 0.5$
Step 6 Set change $= x ^ { i } \times k$
Step 7 Set newr $=$ oldr + change
Step 8 If $- 0.005 <$ change < 0.005 then go to Step 17
Step 9 Set oldr = newr
Step 10 Set $i = i + 1$
Step 11 Set $j = j - 1$
Step 12 Set $k = k \times j \div i$
Step 13 Set change $= x ^ { i } \times k$
Step 14 Set newr $=$ oldr + change
Step 15 If $- 0.005 <$ change < 0.005 then go to Step 17
Step 16 Go to Step 9
Step 17 Print out newr

Use the algorithm to find an estimate of the square root of 1.44 , showing all of the steps.
Consider what happens if the algorithm is applied to 0.56 , and then use your four values of change from part (i) to calculate an estimate of the square root of 0.56 .

OCR MEI D1 2013 January Q4

4 A room has two windows which have the same height but different widths. Each window is to have one curtain. The table lists the tasks involved in making the two curtains, their durations, and their immediate predecessors. The durations assume that only one person is working on the activity.

Task		Duration (minutes)	Immediate predecessor(s)
A	measure windows	5	-
B	calculate material required	5	A
C	choose material	15	-
D	buy material	15	B, C
E	cut material	5	D
F	stitch sides of wide curtain	30	E
G	stitch top of wide curtain	30	F
H	stitch sides of narrow curtain	30	E
I	stitch top of narrow curtain	15	H
J	hang curtains and pin hems	20	G, I
K	hem wide curtain	30	J
L	hem narrow curtain	15	J
M	fit curtains	10	K, L

Draw an activity on arc network for these activities.
Mark on your diagram the early time and the late time for each event. Give the minimum completion time and the critical activities. Kate and Pete have two rooms to curtain, each identical to that above. Tasks A, B, C and D only need to be completed once each. All other tasks will have two versions, one for room 1 and one for room 2, eg E1 and E2. Kate and Pete share the tasks between them so that each task is completed by only one person.
Complete the diagram to show how the tasks can be shared between them, and scheduled, so that the project can be completed in the least possible time. Give that least possible time.
How much extra help would be needed to curtain both rooms in the minimum completion time from part (ii)? Explain your answer.

OCR MEI D1 2013 January Q5

5 A chairlift for a ski slope has 160 4-person chairs. At any one time half of the chairs are going up and half are coming down empty. An observer watches the loading of the chairs during a moderately busy period, and concludes that the number of occupants per 'up' chair has the following probability distribution.

number of occupants	0	1	2	3	4
probability	0.1	0.2	0.3	0.2	0.2

Give a rule for using 1-digit random numbers to simulate the number of occupants of an up chair in a moderately busy period.
Use the 10 random digits provided to simulate the number of occupants in 10 up chairs. The observer estimates that, at all times, on average $20 \%$ of chairlift users are children.
Give an efficient rule for using 1-digit random numbers to simulate whether an occupant of an up chair is a child or an adult.
Use the random digits provided to simulate how many of the occupants of the 10 up chairs are children, and how many are adults. There are more random digits than you will need.
Use your results from part (iv) to estimate how many children and how many adults are on the chairlift (ie on the 80 up chairs) at any instant during a moderately busy period. In a very busy period the number of occupants of an up chair has the following probability distribution.
number of occupants 0 1 2 3 4
probability $\frac { 1 } { 13 }$ $\frac { 1 } { 13 }$ $\frac { 3 } { 13 }$ $\frac { 3 } { 13 }$ $\frac { 5 } { 13 }$
Give an efficient rule for using 2-digit random numbers to simulate the number of occupants of an up chair in a very busy period.
Use the 2-digit random numbers provided to simulate the number of occupants in 5 up chairs. There are more random numbers provided than you will need.
Simulate how many of the occupants of the 5 up chairs are children and how many are adults, and thus estimate how many children and how many adults are on the chairlift at any instant during a very busy period.
Discuss the relative merits of simulating using a sample of 10 chairs as against simulating using a sample of 5 chairs.

OCR MEI D1 2013 January Q6

6 Jean knits items for charity. Each month the charity provides her with 75 balls of wool.
She knits hats and scarves. Hats require 1.5 balls of wool each and scarves require 3 balls each. Jean has 100 hours available each month for knitting. Hats require 4 hours each to make, and scarves require 2.5 hours each. The charity sells the hats for $\pounds 7$ each and the scarves for $\pounds 10$ each, and wants to gain as much income as possible. Jean prefers to knit hats but the charity wants no more than 20 per month. She refuses to knit more than 20 scarves each month.

Define appropriate variables, construct inequality constraints, and draw a graph representing the feasible region for this decision problem.
Give the objective function and find the integer solution which will give Jean's maximum monthly income.
If the charity drops the price of hats in a sale to $\pounds 4$ each, what would be an optimal number of hats and scarves for Jean to knit? Assuming that all hats and scarves are sold, by how much would the monthly income drop?

OCR MEI D1 2005 June Q3

8 marks

3 Table 3 gives the durations and immediate predecessors for the five activities of a project. \begin{table}[h]

Activity	Duration (hours)	Immediate predecessor(s)
A	3	-
B	2	-
C	5	-
D	2	A
E	1	A, B

\captionsetup{labelformat=empty} \caption{Table 3}

\end{table}

Draw an activity-on-arc network to represent the precedences.
Find the early and late event times for the vertices of your network, and list the critical activities.
Give the total and independent float for each activity which is not critical.

OCR MEI D1 2005 June Q5

3 marks

5 A computer store has a stock of 10 laptops to lend to customers while their machines are being repaired. On any particular day the number of laptop loans requested follows the distribution given in Table 5.1. \begin{table}[h]

Number requested	0	1	2	3	4
Probability	0.20	0.30	0.20	0.15	0.15

\captionsetup{labelformat=empty} \caption{Table 5.1}

\end{table}

Give an efficient rule for using two-digit random numbers to simulate the daily number of requests for laptop loans.
Use two-digit random numbers from the list below to simulate the number of loans requested on each of ten successive days. Random numbers: $23,02,57,80,31,72,92,78,04,07$ The number of laptops returned from loan each day is modelled by the distribution given in Table 5.2, independently of the number on loan (which is always at least 5 ). \begin{table}[h]
Number returned 0 1 2 3
Probability $\frac { 1 } { 6 }$ $\frac { 1 } { 4 }$ $\frac { 1 } { 4 }$ $\frac { 1 } { 3 }$
\captionsetup{labelformat=empty} \caption{Table 5.2}
\end{table}
Give an efficient rule for using two-digit random numbers to simulate the daily number of laptop returns.
Use two-digit random numbers from the list below to simulate the number of returns on each of ten successive days. Random numbers: $32,98,01,32,14,21,32,71,82,54,47$ At the end of day 0 there are 7 laptops out on loan and 3 in stock. Each day returns are made in the morning and loans go out in the afternoon. If there is no laptop available the customer is disappointed and never gets a loaned laptop.
Use your simulated numbers of requests and returns to simulate what happens over the next 10 days. For each day record the day number, the number of laptops in stock at the end of the day, and the number of customers that have to be disappointed.
[0pt] [3] To try to avoid disappointing customers, if the number of laptops in stock at the end of a day is 2 or fewer, the store sends out e-mails to customers with loaned laptops asking for early return if possible. This changes the return distribution for the next day to that given in Table 5.3. \begin{table}[h]
Number returned 0 1 2 3 4
Probability 0.1 0.1 0.4 0.2 0.2
\captionsetup{labelformat=empty} \caption{Table 5.3}
\end{table}
Simulate the 10 days again, but using this new policy. Use the requests you produced in part (ii). Use the random numbers given in part (iv) to simulate returns, but use either the distribution given in Table 5.2 or that given in Table 5.3, depending on the number of laptops in stock at the end of the previous day. Is the new policy better?

OCR MEI D1 2005 June Q6

1 marks

6 A company manufactures two types of potting compost, Flowerbase and Growmuch. The weekly amounts produced of each are constrained by the supplies of fibre and of nutrient mix. Each litre of Flowerbase requires 0.75 litres of fibre and 1 kg of nutrient mix. Each litre of Growmuch requires 0.5 litres of fibre and 2 kg of nutrient mix. There are 12000 litres of fibre supplied each week, and 25000 kg of nutrient mix. The profit on Flowerbase is 9 p per litre. The profit on Growmuch is 20 p per litre.

Formulate an LP to maximise the weekly profit subject to the constraints on fibre and nutrient mix.
Solve your LP using a graphical approach.
Consider each of the following separate circumstances.
(A) There is a reduction in the weekly supply of fibre from 12000 litres to 10000 litres. What effect does this have on profit?
(B) The price of fibre is increased. Will this affect the optimal production plan? Justify your answer.
[0pt] (C) The supply of nutrient mix is increased to 30000 kg per week. What is the new profit? [1]

OCR MEI D1 2006 June Q2

2 Fig. 2.1 represents the two floors of a house. There are 5 rooms shown, plus a hall and a landing, which are to be regarded as separate rooms. Each " × " represents an internal doorway connecting two rooms. The " ⊗ " represents the staircase, connecting the hall and the landing. \begin{figure}[h]

\includegraphics[alt={},max width=\textwidth]{c429bfed-9241-409a-9cd5-9553bf16c9df-3_401_1287_447_388} \captionsetup{labelformat=empty} \caption{Fig. 2.1}

\end{figure}

Draw a graph representing this information, with vertices representing rooms, and arcs representing internal connections (doorways and the stairs). What is the name of the type of graph of which this is an example?
A larger house has 12 rooms on two floors, plus a hall and a landing. Each ground floor room has a single door, which leads to the hall. Each first floor room has a single door, which leads to the landing. There is a single staircase connecting the hall and the landing. How many arcs are there in the graph of this house?
Another house has 12 rooms on three floors, plus a hall, a first floor landing and a second floor landing. Again, each room has a single door on to the hall or a landing. There is one staircase from the hall to the first floor landing, and another staircase joining the two landings. How many arcs are there in the graph of this house?
Fig. 2.2 shows the graph of another two-floor house. It has 8 rooms plus a hall and a landing. There is a single staircase. \begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{c429bfed-9241-409a-9cd5-9553bf16c9df-3_208_666_1896_694} \captionsetup{labelformat=empty} \caption{Fig. 2.2}
\end{figure} Draw a possible floor plan, showing internal connections.

OCR MEI D1 2006 June Q3

3 An incomplete algorithm is specified in Fig. 3.
$\mathrm { f } ( \mathrm { x } ) = \mathrm { x } ^ { 2 } - 2$
Initial values: $\mathrm { L } = 0 , \mathrm { R } = 2$.
Step 1 Compute $\mathrm { M } = \frac { \mathrm { L } + \mathrm { R } } { 2 }$.
Step 2 Compute $\mathrm { f } ( \mathrm { M } )$.
Step 3 If $\mathrm { f } ( \mathrm { M } ) < 0$ change the value of L to that of M .
Otherwise change the value of $R$ to that of $M$.
Step 4 Go to Step 1. \section*{Fig. 3}

Apply two iterations of the algorithm.
After 10 iterations $\mathrm { L } = 1.414063 , \mathrm { R } = 1.416016 , \mathrm { M } = 1.416016$ and $\mathrm { f } ( \mathrm { M } ) = 0.005100$. Say what the algorithm achieves.
Say what is needed to complete the algorithm.

OCR MEI D1 2006 June Q4

4 Table 4.1 shows some of the activities involved in preparing for a meeting. \begin{table}[h]

	Activity	Duration (hours)	Immediate predecessors
A	Agree date	1	-
B	Construct agenda	0.5	-
C	Book venue	0.25	A
D	Order refreshments	0.25	C
E	Inform participants	0.5	B, C

\captionsetup{labelformat=empty} \caption{Table 4.1}

\end{table}

Draw an activity-on-arc network to represent the precedences.
Find the early event time and the late event time for each vertex of your network, and list the critical activities.
Assuming that each activity requires one person and that each activity starts at its earliest start time, draw a resource histogram.
In fact although activity A has duration 1 hour, it actually involves only 0.5 hours work, since 0.5 hours involves waiting for replies. Given this information, and the fact that there is only one person available to do the work, what is the shortest time needed to prepare for the meeting? Fig. 4.2 shows an activity network for the tasks which have to be completed after the meeting. \begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{c429bfed-9241-409a-9cd5-9553bf16c9df-5_533_844_1688_294} \captionsetup{labelformat=empty} \caption{Fig. 4.2}
\end{figure} P: Clean room
Q: Prepare draft minutes
R: Allocate action tasks
S: Circulate draft minutes
T: Approve task allocations
U: Obtain budgets for tasks
V: Post minutes
W: Pay refreshments bill
Draw a precedence table for these activities.

OCR MEI D1 2006 June Q5

5 John is reviewing his lifestyle, and in particular his leisure commitments. He enjoys badminton and squash, but is not sure whether he should persist with one or both. Both cost money and both take time. Playing badminton costs $\pounds 3$ per hour and playing squash costs $\pounds 4$ per hour. John has $\pounds 11$ per week to spend on these activities. John takes 0.5 hours to recover from every hour of badminton and 0.75 hours to recover from every hour of squash. He has 5 hours in total available per week to play and recover.

Define appropriate variables and formulate two inequalities to model John's constraints.
Draw a graph to represent your inequalities. Give the coordinates of the vertices of your feasible region.
John is not sure how to define an objective function for his problem, but he says that he likes squash "twice as much" as badminton. Letting every hour of badminton be worth one "satisfaction point" define an objective function for John's problem, taking into account his "twice as much" statement.
Solve the resulting LP problem.
Given that badminton and squash courts are charged by the hour, explain why the solution to the LP is not a feasible solution to John's practical problem. Give the best feasible solution.
If instead John had said that he liked badminton more than squash, what would have been his best feasible solution?

OCR MEI D1 2007 June Q1

1 Bus routes connect towns A and B and towns A and C .
Train lines connect towns B and D, towns C and D, and towns A and C.
John represents this information in a graph with four nodes, one for each town, in which an arc is drawn for each connection, giving five arcs in all.

Draw John's graph.
Is John's graph simple? Justify your answer. Jamil represents the information in a graph with five nodes. He uses one node for each of towns A, B and D. Because in town C the bus station and train station are some distance apart, he uses a node labelled C (bus) and a node labelled C (train). Again there are 5 arcs, each representing a connection.
Draw Jamil's graph.
Is Jamil's graph a tree? Justify your answer.

OCR MEI D1 2007 June Q2

2 Two hikers each have a 25 litre rucksack to pack. The items to be packed have volumes of 14, 6, 11, 9 and 6 litres.

Apply the first fit algorithm to the items in the order given and comment on the outcome.
Write the five items in descending order of volume. Apply the first fit decreasing algorithm to find a packing for the rucksacks.
The hikers argue that the first fit decreasing algorithm does not produce a fair allocation of volumes to rucksacks. Produce a packing which gives a fairer allocation of volumes between the two rucksacks. Explain why the hikers might not want to use this packing.

OCR MEI D1 2007 June Q3

3 Use a graphical approach to solve the following LP. $$\begin{aligned} & \text { Maximise } \quad 2 x + 3 y
& \text { subject to } \quad x + 5 y \leqslant 14
& \quad x + 2 y \leqslant 8
& \quad 3 x + y \leqslant 21
& \quad x \geqslant 0
& y \geqslant 0 \end{aligned}$$ Section B (48 marks)

OCR MEI D1 2007 June Q4

4 Colin is setting off for a day's sailing. The table and the activity network show the major activities that are involved, their durations and their precedences.

A	Rig foresail
B	Lower sprayhood
C	Start engine
D	Pump out bilges
E	Rig mainsail
F	Cast off mooring ropes
G	Motor out of harbour
H	Raise foresail
I	Raise mainsail
J	Stop engine and start sailing

\includegraphics[max width=\textwidth, alt={}, center]{21ab732d-435e-4f0b-bc88-21ddc2a398c9-3_480_912_555_925}

Complete the table in your answer book showing the immediate predecessors for each activity.
Find the early time and the late time for each event. Give the project duration and list the critical activities. When he sails on his own Colin can only do one thing at a time with the exception of activity G, motoring out of the harbour.
Use the activity network to determine which activities Colin can perform whilst motoring out of the harbour.
Find the minimum time to complete the activities when Colin sails on his own, and give a schedule for him to achieve this.
Find the minimum time to complete the activities when Colin sails with one other crew member, and give a schedule for them to achieve this.

OCR MEI D1 2007 June Q5

5 The table shows the weights on the arcs of a network.

	A	B	C	D	E	F	G
A	-	11	-	-	10	3	5
B	11	-	8	5	-	-	14
C	-	8	-	2	-	7	-
D	-	5	2	-	6	-	-
E	10	-	-	6	-	6	-
F	3	-	7	-	6	-	-
G	5	14	-	-	-	-	-

Draw the network.
Apply Dijkstra's algorithm to find the least weight route from G to D. (Do this on the network you drew for part (i).) Give your route and its total weight.
Find by inspection the route from $G$ to $D$ such that the minimum of the weights for arcs on the route is as large as possible. Give your route and its minimum arc weight. Give an application in which this might be needed.
Consider how Dijkstra's algorithm could be modified to solve the problem in part (iii). Explain how to update working values. Explain how to select the next vertex to be permanently labelled.

OCR MEI D1 2007 June Q6

6 In winter in Metland the weather each day can be classified as dry, wet or snowy. The table shows the probabilities for the next day's weather given the current day's weather.

\cline { 3 - 5 } \multicolumn{2}{c|}{}

next day's weather

\cline { 3 - 5 } \multicolumn{2}{c|}{}

You are to use two-digit random numbers to simulate the winter weather in Metland.

Give an efficient rule for using two-digit random numbers to simulate tomorrow's weather if today is
(A) dry,
(B) wet,
(C) snowy.
Today is a dry winter's day in Metland. Use the following two-digit random numbers to simulate the next 7 days' weather in Metland. $$\begin{array} { l l l l l l l l l l } 23 & 85 & 98 & 99 & 56 & 47 & 82 & 14 & 03 & 12 \end{array}$$
Use your simulation from part (ii) to estimate the proportion of dry days in a Metland winter.
Explain how you could use simulation to produce an improved estimate of the proportion of dry days in a Metland winter.
Give two criticisms of this model of weather.

OCR MEI D1 2008 June Q1

1 Consider the following LP.
Maximise $x + y$
subject to $2 x + y < 44$
$2 x + 3 y < 60$
$10 x + 11 y < 244$
Part of a graphical solution is produced below and in your answer book.
Complete this graphical solution in your answer book.
\includegraphics[max width=\textwidth, alt={}, center]{8eba759f-38bc-4d14-ac65-9a0ee6c79741-2_1316_1346_916_356}

number of occupants	0	1	2	3	4
probability	\(\frac { 1 } { 13 }\)	\(\frac { 1 } { 13 }\)	\(\frac { 3 } { 13 }\)	\(\frac { 3 } { 13 }\)	\(\frac { 5 } { 13 }\)

Number returned	0	1	2	3
Probability	\(\frac { 1 } { 6 }\)	\(\frac { 1 } { 4 }\)	\(\frac { 1 } { 4 }\)	\(\frac { 1 } { 3 }\)

	A	B	C	D	E	F	G
A	-	5	2	3	-	-	-
B	5	-	-	-	1	1	-
C	2	-	-	-	4	1	-
D	3	-	-	-	4	2	-
E	-	1	4	4	-	-	1
F	-	1	1	2	-	-	5
G	-	-	-	-	1	5	-

	A	B	C	D	E	F	G
A	-	11	-	-	10	3	5
B	11	-	8	5	-	-	14
C	-	8	-	2	-	7	-
D	-	5	2	-	6	-	-
E	10	-	-	6	-	6	-
F	3	-	7	-	6	-	-
G	5	14	-	-	-	-	-

	A	B	C	D	E	F	G
A	-	5	2	3	-	-	-
B	5	-	-	-	1	1	-
C	2	-	-	-	4	1	-
D	3	-	-	-	4	2	-
E	-	1	4	4	-	-	1
F	-	1	1	2	-	-	5
G	-	-	-	-	1	5	-

	A	B	C	D	E	F	G
A	-	11	-	-	10	3	5
B	11	-	8	5	-	-	14
C	-	8	-	2	-	7	-
D	-	5	2	-	6	-	-
E	10	-	-	6	-	6	-
F	3	-	7	-	6	-	-
G	5	14	-	-	-	-	-

Questions D1 (899 questions)

Browse by module

Browse by board

OCR MEI D1 2012 January Q2

OCR MEI D1 2012 January Q3

OCR MEI D1 2012 January Q4

OCR MEI D1 2012 January Q5

OCR MEI D1 2012 January Q6

OCR MEI D1 2013 January Q1

OCR MEI D1 2013 January Q2

OCR MEI D1 2013 January Q3

OCR MEI D1 2013 January Q4

OCR MEI D1 2013 January Q5

OCR MEI D1 2013 January Q6

OCR MEI D1 2005 June Q3

OCR MEI D1 2005 June Q5

OCR MEI D1 2005 June Q6

OCR MEI D1 2006 June Q2

OCR MEI D1 2006 June Q3

OCR MEI D1 2006 June Q4

OCR MEI D1 2006 June Q5

OCR MEI D1 2007 June Q1

OCR MEI D1 2007 June Q2

OCR MEI D1 2007 June Q3

OCR MEI D1 2007 June Q4

OCR MEI D1 2007 June Q5

OCR MEI D1 2007 June Q6

OCR MEI D1 2008 June Q1

	A	B	C	D	E	F	G
A	-	5	2	3	-	-	-
B	5	-	-	-	1	1	-
C	2	-	-	-	4	1	-
D	3	-	-	-	4	2	-
E	-	1	4	4	-	-	1
F	-	1	1	2	-	-	5
G	-	-	-	-	1	5	-

	A	B	C	D	E	F	G
A	-	11	-	-	10	3	5
B	11	-	8	5	-	-	14
C	-	8	-	2	-	7	-
D	-	5	2	-	6	-	-
E	10	-	-	6	-	6	-
F	3	-	7	-	6	-	-
G	5	14	-	-	-	-	-