Oxford Cambridge and RSA Wednesday 29 June 216 Morning A2 GCE MATHEMATICS (MEI) 4773/1 Decision Mathematics Computation * 6 3 8 3 2 1 4 7 6 * Candidates answer on the Answer Booklet. OCR supplied materials: 12 page Answer Booklet (OCR12) (sent with general stationery) Graph paper MEI Examination Formulae and Tables (MF2) Other materials required: Scientific or graphical calculator Computer with appropriate software and printing facilities Duration: 2 hours 3 minutes * 4 7 7 3 1 * INSTRUCTIONS TO CANDIDATES Write your name, centre number and candidate number in the spaces provided on the Answer Booklet. Please write clearly and in capital letters. Use black ink. HB pencil may be used for graphs and diagrams only. Answer all the questions. Read each question carefully. Make sure you know what you have to do before starting your answer. You are permitted to use a graphical calculator in this paper. Final answers should be given to a degree of accuracy appropriate to the context. Additional sheets, including computer print-outs, should be fastened securely to the Answer Booklet. Do not write in the bar codes. INFORMATION FOR CANDIDATES The number of marks is given in brackets [ ] at the end of each question or part question. In each of the questions you are required to write spreadsheet or other routines to carry out various processes. For each question you attempt, you should submit print-outs showing the routine you have written and the output it generates. You are not expected to print out and submit everything your routine produces, but you are required to submit sufficient evidence to convince the examiner that a correct procedure has been used. The total number of marks for this paper is 72. This document consists of 8 pages. Any blank pages are indicated. COMPUTING RESOURCES Candidates will require access to a computer with a spreadsheet program, a linear programming package and suitable printing facilities throughout the examination. OCR 216 [Y/12/2662] DC (LK) 126748/2 OCR is an exempt Charity Turn over
2 1 A weed in the lawn sends out seeds and then dies. Some of those seeds germinate and produce new weeds (the first generation). Each of the new weeds sends out seeds and then dies. Those seeds give rise to the second generation, and so on. The number of new weeds generated by each weed is a random variable specified by the probability distribution given in the table. Number of new weeds 1 2 3 Probability.2.4.3.1 (i) Why can there be up to 27 weeds in generation 3, and what is the probability of 27 occurring? [2] (ii) Build a spreadsheet simulation of this process for generations 1, 2 and 3. [6] (iii) Use your simulation model to estimate the probability of extinction by generation 2, i.e. the probability that there are no weeds in generation 2. Explain how you made your estimate. [4] (iv) Use your simulation model to estimate the probabilities of having, 1, 2, 3 or 23 weeds in generation 3. Say how many repetitions of your simulation you used, and why. [5] (v) Use your answers to parts (iii) and (iv) to estimate the probability of extinction at generation 3. [1] OCR 216 4773/1 Jun16
3 2 Basil is planning his new garden. He has identified eight places in which he can locate shrubs, some in the ground and some in pots of various sizes. He has six shrubs to plant. The table shows which shrubs can be planted in which locations. Location 1 2 3 4 5 6 7 8 1 x x 2 x x x x Shrub 3 x x x x 4 x x 5 x x x x 6 x x x (i) Draw a bipartite graph showing the information in the table. [1] (ii) Draw a bipartite graph showing the incomplete matching (S2, L1), (S3, L8), (S5, L2), (S6, L7). [1] (iii) Identify a path connecting S1 with L3 which alternates edges not in the graph in part (ii) with edges that are in part (ii). Hence identify an improved matching and draw it on a third bipartite graph. [4] (iv) Find a maximal matching. [1] (v) Formulate an LP to find a maximal matching. [4] (vi) Run your LP and interpret the results. [2] The costs of planting shrubs vary by location because of the costs of pots, compost, irrigation, etc. The costs are shown in the table. Location 1 2 3 4 5 6 7 8 1 1 1 2 1 2 1 5 Shrub 3 1 2 1 5 4 12 7 5 7 2 2 7 6 5 1 5 (vii) Formulate, run and interpret an LP to find a minimum cost maximal allocation. [5] OCR 216 4773/1 Jun16 Turn over
4 3 A distribution company is planning to expand its operations into a new locality. It has identified potential customers, locations for potential depots and the annual costs of supplying each customer from each depot. These costs are shown in the table. Customer 1 2 3 4 5 6 7 1 25 3 16 52 47 375 2 345 67 3 225 545 21 Depot 3 24 15 43 38 175 4 21 57 48 239 256 5 52 56 343 63 34 In addition, annual costs of renting and running the potential depots are given below. Depot 1 2 3 4 5 Annual cost 22 3 28 25 22 (i) Formulate, run and interpret an integer program to find which depots to establish and which customers to service from which depot. [1] (ii) To what must the annual cost of depot 2 be reduced to make it worth using? Show that your reduced cost is critical and give the best distribution arrangement if depot 2 is used. [4] (iii) Assume that the annual cost of depot 2 has not been reduced. To what must the cost of servicing customer 1 from depot 1 rise for it not to be best to serve customer 1 from depot 1? Show that your increased cost is critical and give the best distribution arrangement if customer 1 is not served from depot 1. [4] OCR 216 4773/1 Jun16
5 4 Ulrike wants to expand her milk delivery business. Ulrike had 2 customers last week, and has 21 customers this week. She argues that, even if she loses 1% of her existing customers each week, as long as her marketing increases the number of customers by 1% more than the previous week s increase, then her total number of customers will increase. Thus next week she can afford to lose 21 customers (1% of 21) if her marketing gains her 11 new customers (11% of (21 2)). (i) Letting u n be the number of customers that Ulrike has in week n, give a recurrence relation for u n + 2 in terms of u n + 1 and u n that models Ulrike s argument. Check that with u = 2 and u1 = 21, your relationship gives u2 = 218. [3] (ii) Show that the auxiliary equation for your recurrence relation is λ - ( α + β) λ + β =, where α =. 99 and b = 1. 1. Show that the equation does not have real roots. [3] (iii) The auxiliary equation for u n does not have real roots. What does this tell you about the behaviour of u n? [1] (iv) Construct a spreadsheet for u n and describe what happens. [5] There are two ways in which the recurrence relation for u n cannot reflect reality. One is that the values that u n can take in reality are non-negative whole numbers. The other is that Ulrike would not wish to argue that if her customer numbers dropped from one week to the next, then her marketing would result in them dropping by 1% more in the following week. (v) Amend your spreadsheet as follows: if the previous week showed a decrease in the number of customers, there are no new customers to add if the previous week showed an increase in the number of customers, the number of new customers is 11% of that increase the final computed number of customers is given to the nearest integer. [2] Ulrike needs convincing that, in following this model, the only realistic way she can save her business in the long run is to reduce the percentage of her existing customers that she loses each week. (vi) Use your spreadsheet from part (v) to illustrate this argument. [2] 2 (vii) Use the auxiliary equation λ - (. 99 + β) λ + β = to make the argument by showing that, with a 1% drop in existing customers, b needs to be at least 1.21 to avoid oscillation. [2] 2 END OF QUESTION PAPER OCR 216 4773/1 Jun16
6 blank PAgE OCR 216 4773/1 Jun16
7 blank PAgE OCR 216 4773/1 Jun16
8 Oxford Cambridge and RSA Copyright Information OCR is committed to seeking permission to reproduce all third-party content that it uses in its assessment materials. OCR has attempted to identify and contact all copyright holders whose work is used in this paper. To avoid the issue of disclosure of answer-related information to candidates, all copyright acknowledgements are reproduced in the OCR Copyright Acknowledgements Booklet. This is produced for each series of examinations and is freely available to download from our public website (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 Copyright Team, First Floor, 9 Hills Road, Cambridge CB2 1GE. OCR is part of the Cambridge Assessment Group; Cambridge Assessment is the brand name of University of Cambridge Local Examinations Syndicate (UCLES), which is itself a department of the University of Cambridge. OCR 216 4773/1 Jun16
GCE Mathematics (MEI) Unit 4773: Decision Mathematics Computation Advanced GCE Mark Scheme for June 216 Oxford Cambridge and RSA Examinations
OCR (Oxford Cambridge and RSA) is a leading UK awarding body, providing a wide range of qualifications to meet the needs of candidates of all ages and abilities. OCR qualifications include AS/A Levels, Diplomas, GCSEs, Cambridge Nationals, Cambridge Technicals, Functional Skills, Key Skills, Entry Level qualifications, NVQs and vocational qualifications in areas such as IT, business, languages, teaching/training, administration and secretarial skills. It is also responsible for developing new specifications to meet national requirements and the needs of students and teachers. OCR is a not-for-profit organisation; any surplus made is invested back into the establishment to help towards the development of qualifications and support, which keep pace with the changing needs of today s society. This mark scheme is published as an aid to teachers and students, to indicate the requirements of the examination. It shows the basis on which marks were awarded by examiners. It does not indicate the details of the discussions which took place at an examiners meeting before marking commenced. All examiners are instructed that alternative correct answers and unexpected approaches in candidates scripts must be given marks that fairly reflect the relevant knowledge and skills demonstrated. Mark schemes should be read in conjunction with the published question papers and the report on the examination. OCR will not enter into any discussion or correspondence in connection with this mark scheme. OCR 216
4773 Mark Scheme June 216 Question Answer Marks Guidance 1 (i) 27 explained.1 (ii) eg gen rand# gen1 rand#s gen2 rand#s gen3 1.6565 1.343122 1.52591 1.13456.468467 1.22856 1.28774 1.64996.621236.417294.183329.519123.472353 generation 1 generation 2 generation 3 3
4773 Mark Scheme June 216 Question Answer Marks Guidance (iii) Repetition and counting or > in generation 2 Number of repetitions specified with some justification e.g. experimental Computation of probability Exact answer is.2928. (ref...galton-watson branching processes) between.2 and.4 (iv) Repetition and counting, 1, 2, 3 or >3 in generation 3 Number of repetitions specified with some justification e.g. experimental Computation of probabilities From 1 simulations....345,.129,.148,.123,.255 between.7 and.8 for first 4 probs 1 st prob 2 to 3 times greater than 2 nd, 3 rd and 4 th (v) Correct subtraction of their probs from (iii) and (iv) Exact answer is.34535.2928 =.5255 4
4773 Mark Scheme June 216 Question Answer Marks Guidance 2 (i) L1 S1 S2 S3 S4 S5 S6 L2 L3 L4 L5 L6 L7 L8 2 (ii) L1 S1 S2 S3 S4 S5 S6 L2 L3 L4 L5 L6 L7 L8 5
4773 Mark Scheme June 216 Question Answer Marks Guidance (iii) (S1, L1), (L1, S2), (S2, L7), (L7, S6), (S6, L3) L1 S1 S2 S3 S4 S5 S6 L2 L3 L4 L5 L6 L7 L8 (iv) (S1, L1), (S2, L5), (S3, L3), (S4, L7), (S5, L4), (S6, L2) 6
4773 Mark Scheme June 216 Question Answer Marks Guidance (v) Max x11+x16+x21+x25+x26+x27+x33+x34+x36+x38+x41+x47+x52+x54+x55 +x58+x62+x63+x67 st x11+x16<1 x21+x25+x26+x27<1 x33+x34+x36+x38<1 x41+x47<1 x52+x54+x55+x58<1 x62+x63+x67<1 x11+x21+x41<1 x52+x62<1 x33+x63<1 x34+x54<1 x25+x55<1 x16+x26+x36<1 x27+x47+x67<1 x38+x58<1 end objective shrub constraints location constraints 7
4773 Mark Scheme June 216 Question Answer Marks Guidance (vi) Variable Value Reduced Cost X11.. X16 1.. X21.. X25 1.. X26.. X27.. X33.. X34.. X36.. X38 1.. X41.. X47 1.. X52.. X54 1.. X55.. X58.. X62.. X63 1.. X67.. X24.. Shrub 1 2 3 4 5 6 Location 6 5 8 7 4 3 8
4773 Mark Scheme June 216 Question Answer Marks Guidance (vii) Min 1x11+1x16+1x21+2x25+1x26+5x27+1x33+2x34+1x36 +5x38+12x41+7x47+7x52+2x54+2x55+7x58+5x62+1x63+5x67 st x11+x16>1 x21+x25+x26+x27>1 x33+x34+x36+x38>1 x41+x47>1 x52+x54+x55+x58>1 x62+x63+x67>1 x11+x21+x41<1 x52+x62<1 x33+x63<1 x34+x54<1 x25+x55<1 x16+x26+x36<1 x27+x47+x67<1 x38+x58<1 end objective constraints running LP Solution has objective 49 eg Shrub 1 2 3 4 5 6 Location 6 1 3 7 8 2 9
4773 Mark Scheme June 216 Question Answer Marks Guidance 3 (i) Min 22d1+3d2+28d3+25d4+22d5+25x11+3x13+16x14 +52x15+47x16+375x17+345x21+67x22+3x23+225x24+545x26 +21x27+24x33+15x34+43x35+38x36+175x37+21x41+57x42 +48x43+239x44+256x47+52x51+56x52+343x54+63x56+34x57 st x11+x21+x41+x51=1 x22+x42+x52=1 x13+x23+x33+x43=1 x14+x24+x34+x44+x54=1 x15+x35=1 x16+x26+x36+x56=1 x17+x27+x37+x47+x57=1 6d1-x11-x13-x14-x15-x16-x17> 6d2-x21-x22-x23-x24-x26-x27> 5d3-x33-x34-x35-x36-x37> 5d4-x41-x42-x43-x44-x47> 5d5-x51-x52-x54-x56-x57> end int 6 Objective value = 7 C1 C2 C3 C4 C5 C6 C7 D1 x x x x x D5 x x cao cao objective customer indicator constraints switching on depot indicators integer variables running objective value depots customers 1
4773 Mark Scheme June 216 Question Answer Marks Guidance (ii) Indifferent at 222. Objective value = 7... showing that the cost reduction is critical, since otherwise the objective would have been reduced C1 C2 C3 C4 C5 C6 C7 D1 x x x x D2 x x x E1 222 ob value still 7 or other valid justification explanation customers (iii) Indifferent at 436/4361 Objective value = 7186 in both cases... demonstrating the criticality C1 C2 C3 C4 C5 C6 C7 D1 x x x x D4 x x x E1 4361 436 explanation customers 11
4773 Mark Scheme June 216 Question Answer Marks Guidance 4 (i) u n+2 =.99u n+1 + 1.1(u n+1 - u n ) = 2u n+1 1.1u n 2 21 1.1 2 = 42 22 = 218 (ii) u n+2 2u n+1 + 1.1u n = 2 2 + 1.1 = (-2) 2 4 1 1.1 < (iii) oscillatory (iv) 2 194.666353 21 1765.297 218 166.292797 2239 1429.932658 2276.2 1237.59592 2291.1 13.787198 2283.58 811.689792 2252.1959 582.2843481 2198.5322 344.762898 2122.288581 11.4169881 224.8891-145.3757345 Customer numbers increase up to u 5, then start to decrease. Negative values seen (so not realistic). Ignore any comments about fractional values. 12
4773 Mark Scheme June 216 Question Answer Marks Guidance 4 (v) 2 2171 21 2149 218 2128 2239 217 2276 286 2291 265 2283 244 226 224 2237 24 2215 1984 2193 1964 correctly rounding removing the negative gains (vi) With =.99 Ulrike would need to exceed 1.26... which seems unreasonable. With =.995 would need to exceed 1.15. With =.999 needs to be around 1.1. With =1 can slip below 1 and still be OK considering some appropriate s considering corresponding s (vii) (.99 + ) 2 4 =.981 2.2 + 2 = ( 1.1) 2.4 For this to be positive we need > 1.21 13
OCR (Oxford Cambridge and RSA Examinations) 1 Hills Road Cambridge C 2EU OCR Customer Contact Centre Education and Learning Telephone: 1223 553998 Facsimile: 1223 552627 Email: general.qualifications@ocr.org.uk www.ocr.org.uk For staff training purposes and as part of our quality assurance programme your call may be recorded or monitored Oxford Cambridge and RSA Examinations is a Company Limited by Guarantee Registered in England Registered Office; 1 Hills Road, Cambridge, C 2EU Registered Company Number: 3484466 OCR is an exempt Charity OCR (Oxford Cambridge and RSA Examinations) Head office Telephone: 1223 552552 Facsimile: 1223 552553 OCR 216
GCE Mathematics (MEI) Max Mark a b c d e u 4751 1 C1 MEI Introduction to advanced mathematics (AS) Raw 72 63 57 52 47 42 UMS 1 8 7 6 5 4 4752 1 C2 MEI Concepts for advanced mathematics (AS) Raw 72 56 49 42 35 29 UMS 1 8 7 6 5 4 4753 (C3) MEI Methods for Advanced Mathematics with 1 Coursework: Written Paper Raw 72 58 52 47 42 36 4753 (C3) MEI Methods for Advanced Mathematics with 2 Coursework: Coursework Raw 18 15 13 11 9 8 4753 (C3) MEI Methods for Advanced Mathematics with 82 Coursework: Carried Forward Coursework Mark Raw 18 15 13 11 9 8 UMS 1 8 7 6 5 4 4754 1 C4 MEI Applications of advanced mathematics (A2) Raw 9 64 57 51 45 39 UMS 1 8 7 6 5 4 4755 1 4756 1 4757 1 FP1 MEI Further concepts for advanced mathematics (AS) Raw 72 59 53 48 43 38 UMS 1 8 7 6 5 4 FP2 MEI Further methods for advanced mathematics (A2) Raw 72 6 54 48 43 38 UMS 1 8 7 6 5 4 FP3 MEI Further applications of advanced mathematics (A2) Raw 72 6 54 49 44 39 UMS 1 8 7 6 5 4 4758 (DE) MEI Differential Equations with Coursework: Written 1 Paper Raw 72 67 61 55 49 43 4758 (DE) MEI Differential Equations with Coursework: 2 Coursework Raw 18 15 13 11 9 8 4758 (DE) MEI Differential Equations with Coursework: Carried 82 Forward Coursework Mark Raw 18 15 13 11 9 8 UMS 1 8 7 6 5 4 4761 1 MEI Mechanics 1 (AS) Raw 72 58 5 43 36 29 UMS 1 8 7 6 5 4 4762 1 M2 MEI Mechanics 2 (A2) Raw 72 59 53 47 41 36 UMS 1 8 7 6 5 4 4763 1 M3 MEI Mechanics 3 (A2) Raw 72 6 53 46 4 34 UMS 1 8 7 6 5 4 4764 1 M4 MEI Mechanics 4 (A2) Raw 72 55 48 41 34 27 UMS 1 8 7 6 5 4 4766 1 S1 MEI Statistics 1 (AS) Raw 72 59 52 46 4 34 UMS 1 8 7 6 5 4 4767 1 S2 MEI Statistics 2 (A2) Raw 72 6 55 5 45 4 UMS 1 8 7 6 5 4 4768 1 S3 MEI Statistics 3 (A2) Raw 72 6 54 48 42 37 UMS 1 8 7 6 5 4 4769 1 S4 MEI Statistics 4 (A2) Raw 72 56 49 42 35 28 UMS 1 8 7 6 5 4 4771 1 D1 MEI Decision mathematics 1 (AS) Raw 72 48 43 38 34 3 UMS 1 8 7 6 5 4 4772 1 D2 MEI Decision mathematics 2 (A2) Raw 72 55 5 45 4 36 UMS 1 8 7 6 5 4 4773 1 DC MEI Decision mathematics computation (A2) Raw 72 46 4 34 29 24 UMS 1 8 7 6 5 4 4776 (NM) MEI Numerical Methods with Coursework: Written 1 Paper Raw 72 55 49 44 39 33 4776 (NM) MEI Numerical Methods with Coursework: 2 Coursework Raw 18 14 12 1 8 7 4776 (NM) MEI Numerical Methods with Coursework: Carried 82 Forward Coursework Mark Raw 18 14 12 1 8 7 UMS 1 8 7 6 5 4 4777 1 NC MEI Numerical computation (A2) Raw 72 55 47 39 32 25 UMS 1 8 7 6 5 4 4798 1 FPT - Further pure mathematics with technology (A2) Raw 72 57 49 41 33 26 Published: 17 August 216 Version 1. 1
UMS 1 8 7 6 5 4 GCE Statistics (MEI) Max Mark a b c d e u G241 1 Statistics 1 MEI (Z1) Raw UMS 72 1 59 8 52 7 46 6 4 5 34 4 G242 1 Statistics 2 MEI (Z2) Raw UMS 72 1 55 8 48 7 41 6 34 5 27 4 G243 1 Statistics 3 MEI (Z3) Raw UMS 72 1 56 8 48 7 41 6 34 5 27 4 GCE Quantitative Methods (MEI) Max Mark a b c d e u G244 1 Introduction to Quantitative Methods MEI Raw 72 58 5 43 36 28 G244 2 Introduction to Quantitative Methods MEI Raw 18 14 12 1 8 7 UMS 1 8 7 6 5 4 G245 1 Statistics 1 MEI Raw UMS 72 1 59 8 52 7 46 6 4 5 34 4 G246 1 Decision 1 MEI Raw UMS 72 1 48 8 43 7 38 6 34 5 3 4 Level 3 Certificate and FSMQ raw mark grade boundaries June 216 series For more information about results and grade calculations, see www.ocr.org.uk/ocr-for/learners-and-parents/getting-your-results Level 3 Certificate Mathematics for Engineering H86 1 Mathematics for Engineering H86 2 Mathematics for Engineering Max Mark a* a b c d e u This unit has no entries in June 216 Level 3 Certificate Mathematical Techniques and Applications for Engineers Max Mark a* a b c d e u H865 1 Component 1 Level 3 Certificate Mathematics - Quantitative Reasoning (MEI) (GQ Reform) Raw 6 48 42 36 3 24 18 Max Mark a b c d e u H866 1 Introduction to quantitative reasoning Raw 72 55 47 39 31 23 H866 2 Critical maths Raw 6 47 41 35 29 23 Overall 132 111 96 81 66 51 Level 3 Certificate Mathematics - Quantitive Problem Solving (MEI) (GQ Reform) Max Mark a b c d e u H867 1 Introduction to quantitative reasoning Raw 72 55 47 39 31 23 H867 2 Statistical problem solving Raw 6 4 34 28 23 18 Overall 132 13 88 73 59 45 Advanced Free Standing Mathematics Qualification (FSMQ) Max Mark a b c d e u 6993 1 Additional Mathematics Raw 1 59 51 44 37 3 Intermediate Free Standing Mathematics Qualification (FSMQ) Max Mark a b c d e u 6989 1 Foundations of Advanced Mathematics (MEI) Raw 4 35 3 25 2 16 Published: 17 August 216 Version 1.1 1
Version 1.1 Details of change Correction to Overall grade boundaries for H866 Correction to Overall grade boundaries for H867 Published: 17 August 216 Version 1.1 2