D2 June 2002 (adapted to include 2002 D1 flows and simplex questions)

Size: px
Start display at page:

Download "D2 June 2002 (adapted to include 2002 D1 flows and simplex questions)"

Transcription

1 June 00 (adapted to include 00 1 flows and simplex questions) 1. igure igure 1 shows a network of roads connecting six villages,,,, and. he lengths of the roads are given in km. (a) omplete the table in the answer booklet, in which the entries are the shortest distances between pairs of villages. You should do this by inspection. he table can now be taken to represent a complete network. (b) Use the nearest-neighbour algorithm, starting at, on your completed table in part (a). Obtain an upper bound to the length of a tour in this complete network, which starts and finishes at and visits every village exactly once. (c) Interpret your answer in part (b) in terms of the original network of roads connecting the six villages. (d) y choosing a different vertex as your starting point, use the nearest-neighbour algorithm to obtain a shorter tour than that found in part (b). tate the tour and its length.. two-person zero-sum game is represented by the following pay-off matrix for player. I II III IV I II III IV (a) etermine the play-safe strategy for each player. (b) Verify that there is a stable solution and determine the saddle points. (c) tate the value of the game to.

2 3. igure ndrew () and arbara () play a zero-sum game. his game is represented by the following payoff matrix for ndrew (a) xplain why this matrix may be reduced to (b) Hence find the best strategy for each player and the value of the game. (8) he network in ig. shows possible routes that an aircraft can take from to. he numbers on the directed arcs give the amount of fuel used on that part of the route, in appropriate units. he airline wishes to choose the route for which the maximum amount of fuel used on any part of the route is as small as possible. his is the rninimax route. (a) omplete the table in the answer booklet. (b) Hence obtain the minimax route from to and state the maximum amount of fuel used on any part of this route. (8) 5. n engineering company has 4 machines available and 4 jobs to be completed. ach machine is to be assigned to one job. he time, in hours, required by each machine to complete each job is shown in the table below. Job 1 Job Job 3 Job 4 Machine Machine Machine Machine Use the Hungarian algorithm, reducing rows first, to obtain the allocation of machines to jobs which minimises the total time required. tate this minimum time. (11)

3 6. he table below shows the distances, in km, between six towns,,,, and (a) tarting from, use Prim s algorithm to find a minimum connector and draw the minimum spanning tree. You must make your method clear by stating the order in which the arcs are selected. (b) (i) Using your answer to part (a) obtain an initial upper hound for the solution of the travelling salesman problem. (ii) Use a short cut to reduce the upper bound to a value less than 680. (c) tarting by deleting, find a lower bound for the solution of the travelling salesman problem. 7. steel manufacturer has 3 factories 1, and 3 which can produce 35, 5 and 15 kilotonnes of steel per year, respectively. hree businesses 1, and 3 have annual requirements of 0, 5 and 30 kilotonnes respectively. he table below shows the cost ij in appropriate units, of transporting one kilotonne of steel from factory i to business j. actory usiness he manufacturer wishes to transport the steel to the businesses at minimum total cost. (a) Write down the transportation pattern obtained by using the North-West corner rule. (b) alculate all of the improvement indices Iij, and hence show that this pattern is not optimal. (c) Use the stepping-stone method to obtain an improved solution. (d) how that the transportation pattern obtained in part (c) is optimal and find its cost. (5)

4 8. igure G he network in ig. 4 models a drainage system. he number on each arc indicates the capacity of that arc, in litres per second. (a) Write down the source vertices. igure G igure 5 shows a feasible flow through the same network. (b) tate the value of the feasible flow shown in ig. 5. aking the flow in ig. 5 as your initial flow pattern, (c) use the labelling procedure on iagram 1 to find a maximum flow through this network. You should list each flow-augmenting route you use, together with its flow. (6) (d) how the maximal flow on iagram and state its value. (e) Prove that your flow is maximal. H H 9. 4 o. Ltd produces three different blends of tea, Morning, fternoon and vening. he teas must be processed, blended and then packed for distribution. he table below shows the time taken, in hours, for each stage of the production of a tonne of tea. It also shows the profit, in hundreds of pounds, on each tonne. Processing lending Packing Profit ( 100) Morning blend fternoon blend vening blend he total times available each week for processing, blending and packing are 35, 0 and 4 hours respectively. 4 o. Ltd wishes to maximise the weekly profit. Let x, y and z be the number of tonnes of Morning, fternoon and vening blend produced each week. (a) ormulate the above situation as a linear programming problem, listing clearly the objective function, and the constraints as inequalities. n initial implex tableau for the above situation is asic variable x y z r s t Value r s t P (b) olve this linear programming problem using the implex algorithm. ake the most negative number in the profit row to indicate the pivot column at each stage. (11) 4 o. Ltd wishes to increase its profit further and is prepared to increase the time available for processing or blending or packing or any two of these three. (c) Use your answer to part (b) to advise the company as to which stage(s) it should increase the time available.

5 10. While solving a maximizing linear programming problem, the following tableau was obtained. asic x y z r s t Value variable 1 r y x P (a) xplain why this is an optimal tableau. (b) Write down the optimal solution of this problem, stating the value of every variable. (c) Write down the profit equation from the tableau. Use it to explain why changing the value of any of the non-basic variables will decrease the value of P company wishes to transport its products from 3 factories 1, and 3 to a single retail outlet R. he capacities of the possible routes, in van loads per day, are shown in ig igure R (a) On iagram 1 in the answer booklet add a supersource to obtain a capacitated network with a single source and a single sink. tate the minimum capacity of each arc you have added. (b) (i) tate the maximum flow along 1R and 3R. (ii) how these maximum flows on iagram in the answer booklet, using numbers in circles. aking your answer to part (b)(ii) as the initial flow pattern, (c) (i) use the labelling procedure to find a maximum flow from to R. Your working should be shown on iagram 3. List each flow-augmenting route you find together with its flow. (ii) Prove that your final flow is maximal. (7)

6 003 (adapted for new spec) 1. two person zero-sum game is represented by the following pay-off matrix for player. 1. igure W1 W W R1 R plays I plays II plays III plays I 3 5 plays II (a) Write down the pay off matrix for player. (b) ormulate the game as a linear programming problem for player, writing the constraints as equalities and stating your variables clearly. (otal 6 marks). (a) xplain the difference between the classical and practical travelling salesman problems. company has 3 warehouses W1, W, and W3. It needs to transport the goods stored there to retail outlets R1 and R. he capacities of the possible routes, in van loads per day, are shown in ig. Warehouses W1, W and W3 have 14, 1 and 14 van loads respectively available per day and retail outlets R1 and R can accept 6 and 5 van loads respectively per day. (a) On iagram 1 on the answer sheet add a supersource W, a supersink R and the appropriate directed arcs to obtain a single-source, single-sink capacitated network. tate the minimum capacity of each arc you have added. (b) tate the maximum flow along (i) W W1 R1 R, (ii) WW3 R R. (c) aking your answers to part (b) as the initial flow pattern, use the labelling procedure to obtain a maximum flow through the network from W to R. how your working on iagram. List each flowaugmenting route you use, together with its flow. (5) (d) rom your final flow pattern, determine the number of van loads passing through each day. (b) he network in the diagram above shows the distances, in kilometres, between eight Mcurger restaurants. n inspector from head office wishes to visit each restaurant. His route should start and finish at, visit each restaurant at least once and cover a minimum distance. Obtain a minimum spanning tree for the network using Kruskal s algorithm. You should draw your tree and state the order in which the arcs were added. 13 G H (c) Use your answer to part (b) to determine an initial upper bound for the length of the route. (d) tarting from your initial upper bound and using an appropriate method, find an upper bound which is less than 135 km. tate your tour. (otal 10 marks)

7 3. alkalot ollege holds an induction meeting for new students. he meeting consists of four talks: I (Welcome), II (Options and acilities), III (tudy ips) and IV (Planning for uccess). he four department heads, live, Julie, Nicky and teve, deliver one of these talks each. he talks are delivered consecutively and there are no breaks between talks. he meeting starts at 10 a.m. and ends when all four talks have been delivered. he time, in minutes, each department head takes to deliver each talk is given in the table below. (a) alk I alk II alk III alk IV live Julie Nicky teve Use the Hungarian algorithm to find the earliest time that the meeting could end. You must make your method clear and show 5. he manager of a car hire firm has to arrange to move cars from three garages, and to three airports, and so that customers can collect them. he table below shows the transportation cost of moving one car from each garage to each airport. It also shows the number of cars available in each garage and the number of cars required at each airport. he total number of cars available is equal to the total number required. (a) irport irport irport ars available Garage Garage Garage ars required Use the North-West corner rule to obtain a possible pattern of distribution and find its cost. (b) (i) the state of the table after each stage in the algorithm, (ii) the final allocation. Modify the table so it could be used to find the latest time that the meeting could end. (10) (b) (c) alculate shadow costs for this pattern and hence obtain improvement indices for each route. Use the stepping-stone method to obtain an optimal solution and state its cost. (7) (otal 14 marks) 4. two person zero-sum game is represented by the following pay-off matrix for player. (otal 13 marks) 6. Kris produces custom made racing cycles. he can produce up to four cycles each month, but if she wishes to produce more than three in any one month she has to hire additional help at a cost of 350 for that month. In any month when cycles are produced, the overhead costs are 00. maximum of 3 cycles can be held in stock in any one month, at a cost of 40 per cycle per month. ycles must be delivered at the end of the month. he order book for cycles is plays I plays II plays III Month ugust eptember October November plays I 1 3 Number of cycles required (a) plays II plays III Identify the play safe strategies for each player. isregarding the cost of parts and Kris time, (a) determine the total cost of storing cycles and producing 4 cycles in a given month, making your calculations clear. (b) (c) Verify that there is no stable solution to this game. xplain why the pay-off matrix above may be reduced to here is no stock at the beginning of ugust and Kris plans to have no stock after the November delivery. (b) Use dynamic programming to determine the production schedule which minimises the costs, showing your working in the table below. plays I plays II plays III tage emand tate ction estination Value plays I 1 3 plays II (Nov) 0 (in stock) (make) (in stock) (make) (in stock) (make) (d) ind the best strategy for player, and the value of the game. (7) (otal 14 marks) (Oct) = (13)

8 he fixed cost of parts is 600 per cycle and of Kris time is 500 per month. he sells the cycles for 000 each. (c) etermine her total profit for the four month period. (otal 18 marks) (c) ind the value of cuts 1 and. tarting with the given feasible flow of 68, (d) use the labelling procedure on iagram to find a maximal flow through this network. List each flow-augmenting route you use, together with its flow. 7. iagram igure 1 igure 1 shows a capacitated, directed network. he unbracketed number on each arc indicates the capacity of that arc, and the numbers in brackets show a feasible flow of value 68 through the network. (a) 1 45 (38) 35 (30) 4 (0) 0 (18) 1 (1) 15 (15) 0 (18) 10 (5) dd a supersource and a supersink, and arcs of appropriate capacity, to iagram 1 below. 8 (5) 1 8 ( y) 4 G 8 ( x) 5 (18) H 9 (9) 5 (5) 15 (10) 8 (6) 1 (e) 1 how your maximal flow on iagram 3 and state its value. iagram 3 G H 1 (6) iagram (38) 35 (30) 4 (0) 0 (18) 1 (1) 15 (15) 0 (18) 10 (5) 8 (5) 8 ( y) 4 G 8 ( x) 5 (18) 9 (9) 15 (10) H 8 (6) 5 (5) 1 (f) 1 Prove that your flow is maximal. G H (otal 18 marks) (b) ind the values of x and y, explaining your method briefly.

9 8. he tableau below is the initial tableau for a maximising linear programming problem. 004 (adapted for new spec) (a) asic variable x y z r s Value r s P or this problem x 0, y 0, z 0. Write down the other two inequalities and the objective function. 1. In game theory explain what is meant by (a) zero-sum game, (b) saddle point. (otal 4 marks). In a quiz there are four individual rounds, rt, Literature, Music and cience. team consists of four people, onna, Hannah, Kerwin and homas. ach of four rounds must be answered by a different team member. he table shows the number of points that each team member is likely to get on each individual round. rt Literature Music cience (b) olve this linear programming problem. You may not need to use all of these tableaux. onna Hannah Kerwin b.v. x y z r s Value homas P Use the Hungarian algorithm, reducing rows first, to obtain an allocation which maximises the total points likely to be scored in the four rounds. You must make your method clear and show the table after each stage. (otal 9 marks) - b.v. x y z r s Value P b.v. x y z r s Value 3. he table shows the least distances, in km, between five towns,,,, and. Nassim wishes to find an interval which contains the solution to the travelling salesman problem for this network. (a) Making your method clear, find an initial upper bound starting at and using (i) (ii) the minimum spanning tree method, the nearest neighbour algorithm (7) P (b) y deleting, find a lower bound. b.v. x y z r s Value (c) Using your answers to parts (a) and (b), state the smallest interval that Nassim could correctly write down. (otal 1 marks) P (8) 4. mma and reddie play a zero-sum game. his game is represented by the following pay-off matrix for mma. 1 (c) tate the final value of P, the objective function, and of each of the variables. (otal 14 marks) (a) (b) how that there is no stable solution. ind the best strategy for mma and the value of the game to her. (8) (c) Write down the value of the game to reddie and his pay-off matrix. (otal 14 marks)

10 5. (a) escribe a practical problem that could be solved using the transportation algorithm. problem is to be solved using the transportation problem. he costs are shown in the table. he supply is from, and and the demand is at d and e. d e upply emand (b) xplain why it is necessary to add a third demand f. (c) Use the north-west corner rule to obtain a possible pattern of distribution and find its cost. able 3 ravel costs ( ) G H Home It is decided to use dynamic programming to find a schedule that maximises the total expected profit, taking into account the travel costs. (a) efine suitable stage, state and action variables. d e f upply emand (5) 7. (b) (c) etermine the schedule that maximises the total profit. how your working in a table. (1) dvise Joan on the shows that she should visit and state her total expected profit. (otal 18 marks) igure 1 (d) alculate shadow costs and improvement indices for this pattern. 4 0 G (e) Use the stepping-stone method once to obtain an improved solution and its cost. (5) (5) (otal 16 marks) 6. Joan sells ice cream. he needs to decide which three shows to visit over a three-week period in the summer. he starts the three-week period at home and finishes at home. he will spend one week at each of the three shows she chooses travelling directly from one show to the next H 7 I 8 able 1 gives the week in which each show is held. able gives the expected profits from visiting each show. able 3 gives the cost of travel between shows. able 1 Week 1 3 hows,,,, G, H able how G H xpected Profit ( ) igure 1 shows a capacitated directed network. he number on each arc is its capacity. igure 0 G 0 x y 14 I H

11 igure shows a feasible initial flow through the same network. d) how your maximal flow pattern on iagram. (a) Write down the values of the flow x and the flow y. iagram (b) Obtain the value of the initial flow through the network, and explain how you know it is not maximal. G (c) Use this initial flow and the labelling procedure on iagram 1 below to find a maximum flow through the network. You must list each flow-augmenting route you use, together with its flow. iagram 1 I I G H H (e) Prove that your flow is maximal. (otal 13 marks) 8. three-variable linear programming problem in x, y and z is to be solved. he objective is to maximise the profit P. he following tableau was obtained. asic variable x y Z r s t Value s r y P (a) (b) tate, giving your reason, whether this tableau represents the optimal solution. tate the values of every variable. (c) alculate the profit made on each unit of y. (otal 6 marks) (5)

12 latland UK Ltd makes three types of carpet, the Lincoln, the Norfolk and the uffolk. he carpets all require units of black, green and red wool he diagram above shows a network of roads represented by arcs. he capacity of the road represented by that arc is shown on each arc. he numbers in circles represent a possible flow of 6 from to L. hree cuts 1, and 3 are shown on he diagram above H I 7 G J K L or each roll of carpet, the Lincoln requires 1 unit of black, 1 of green and 3 of red, the Norfolk requires 1 unit of black, of green and of red, and the uffolk requires units of black, 1 of green and 1 of red. here are up to 30 units of black, 40 units of green and 50 units of red available each day. Profits of 50, 80 and 60 are made on each roll of Lincoln, Norfolk and uffolk respectively. latland UK Ltd wishes to maximise its profit. Let the number of rolls of the Lincoln, Norfolk and uffolk made daily be x, y and z respectively. (a) ormulate the above situation as a linear programming problem, listing clearly the constraints as inequalities in their simplest form, and stating the objective function. his problem is to be solved using the implex algorithm. he most negative number in the profit row is taken to indicate the pivot column at each stage. (b) tating your row operations, show that after one complete iteration the tableau becomes asic variable x y z r s t Value r y t P (a) ind the capacity of each of the three cuts. (b) Verify that the flow of 6 is maximal. he government aims to maximise the possible flow from to L by using one of two options. Option 1: uild a new road from to J with capacity 5. You may not need to use all of the tableaux. asic variable x y z r s t Value r s t Row operations or Option : uild a new road from to H with capacity 3. P (c) y considering both options, explain which one meets the government s aim - asic variable x y z r s t Value Row operations -

13 (c) xplain the practical meaning of the value 10 in the top row. (d) (i) Perform one further complete iteration of the implex algorithm. asic variable x y z r s t Value Row operations 005 (adapted for new spec) 1. reezy o. has three factories, and. It supplies freezers to three shops, and. he table shows the transportation cost in pounds of moving one freezer from each factory to each outlet. It also shows the number of freezers available for delivery at each factory and the number of freezers required at each shop. he total number of freezers required is equal to the total number of freezers available. vailable asic variable x y z r s t Value Row operations (a) Required Use the north-west corner rule to find an initial solution. (b) (c) Obtain improvement indices for each unused route. Use the stepping-stone method once to obtain a better solution and state its cost. (5) (otal 11 marks) (ii) tate whether your current answer to part (d)(i) is optimal. Give a reason for your answer.. (iii) Interpret your current tableau, giving the value of each variable. (8) (otal 18 marks) G he network in the diagram shows the distances, in km, of the cables between seven electricity relay stations,,,,, and G. n inspector needs to visit each relay station. He wishes to travel a minimum distance, and his route must start and finish at the same station. y deleting, a lower bound for the length of the route is found to be 19 km. (a) (b) ind another lower bound for the length of the route by deleting. tate which is the better lower bound of the two. y inspection, complete the table of least distances. (5) he table can now be taken to represent a complete network. (c) Using the nearest-neighbour algorithm, starting at, obtain an upper bound to the length of the route. tate your route. (otal 11 marks)

14 3. hree warehouses W, X and Y supply televisions to three supermarkets J, K and L. he table gives the cost, in pounds, of transporting a television from each warehouse to each supermarket. he warehouses have stocks of 34, 57 and 5 televisions respectively, and the supermarkets require 0, 56 and 40 televisions respectively. he total cost of transporting the televisions is to be minimised. J K L W X Y 5 7 ormulate this transportation problem as a linear programming problem. Make clear your decision variables, objective function and constraints. (otal 7 marks) 4. (a) xplain what is meant by a maximin route in dynamic programming, and give an example of a situation that would require a maximin solution. 5. our salesperson,, and are to be sent to visit four companies 1,, 3 and 4. ach salesperson will visit exactly one company, and all companies will be visited. Previous sales figures show that each salesperson will make sales of different values, depending on the company that they visit. hese values (in s) are shown in the table below. (a) (b) nn renda onnor ave Use the Hungarian algorithm to obtain an allocation that maximises the sales. You must make your method clear and show the table after each stage. tate the value of the maximum sales. (11) H 16 3 I G 8 J maximin route is to be found through the network shown in the diagram. (b) omplete the table in the answer book, and hence find a maximin route K (9) 6. (c) how that there is a second allocation that maximises the sales (otal 15 marks) (c) List all other maximin routes through the network. (otal 14 marks) his figure shows a capacitated directed network. he number on each arc is its capacity. he numbers in circles show a feasible flow through the network. ake this as the initial flow. (a) On iagram 1 and iagram in the answer book, add a supersource and a supersink. On iagram 1 show the minimum capacities of the arcs you have added. iagram in the answer book shows the first stage of the labelling procedure for the given initial flow. (b) omplete the initial labelling procedure in iagram. (c) ind the maximum flow through the network. You must list each flow-augmenting route you use together with its flow, and state the maximal flow. (6)

15 (d) how a maximal flow pattern on iagram 3. (c) ind the best strategy for player and the value of the game to her. (8) (e) (f) Prove that your flow is maximal. escribe briefly a situation for which this network could be a suitable model. (otal 16 marks) (d) ormulate the game as a linear programming problem for player. Write the constraints as inequalities and define your variables clearly. (5) (otal 17 marks) 8. Polly has a bird food stall at the local market. ach week she makes and sells three types of packs, and Pack contains 4 kg of bird seed, suet blocks and 1 kg of peanuts. Pack contains 5 kg of bird seed, 1 suet block and kg of peanuts. Pack contains 10 kg of bird seed, 4 suet blocks and 3 kg of peanuts. ach week Polly has 140 kg of bird seed, 60 suet blocks and 60 kg of peanuts available for the packs. he profit made on each pack of, and sold is 3.50, 3.50 and 6.50 respectively. Polly sells every pack on her stall and wishes to maximise her profit, P pence. Let x, y and z be the numbers of packs, and sold each week. n initial implex tableau for the above situation is asic variable x y z r s t Value r s t P (a) (b) xplain the meaning of the variables r, s and t in the context of this question. Perform one complete iteration of the implex algorithm to form a new tableau. ake the most negative number in the profit row to indicate the pivotal column. (5) (c) tate the value of every variable as given by tableau. (d) Write down the profit equation given by tableau. 7. (a) xplain briefly what is meant by a zero-sum game. (e) Use your profit equation to explain why tableau is not optimal. aking the most negative number in the profit row to indicate the pivotal column, two person zero-sum game is represented by the following pay-off matrix for player. I II III (f) identify clearly the location of the next pivotal element. (otal 15 marks) I 5 3 II (b) Verify that there is no stable solution to this game.

16 9. iagram his diagram shows a capacitated directed network. he number on each arc is its capacity. (a) tate the maximum flow along (i), (ii), (iii). (b) how these maximum flows on iagram 1 below. (ii) raw your final flow pattern on iagram 3 below. iagram 3 (5) iagram 1 (iii) Prove that your flow is maximal. ake your answer to part (b) as the initial flow pattern. (c) (i) Use the labelling procedure to find a maximum flow from to. Your working should be shown on iagram below. List each flow-augmenting route you use, together with its flow. (d) Give an example of a practical situation that could have been modelled by the original network. (otal 14 marks)

17 Jan 006 (adapted for new spec) 1. theme park has four sites,,, and, on which to put kiosks. ach kiosk will sell a different type of refreshment. he income from each kiosk depends upon what it sells and where it is located. he table below shows the expected daily income, in pounds, from each kiosk at each site. Hot dogs and beef burgers (H) Ice cream (I) Popcorn, candyfloss and drinks (P) nacks and hot drinks () ite ite ite ite Reducing rows first, use the Hungarian algorithm to determine a site for each kiosk in order to maximise the total income. tate the site for each kiosk and the total expected income. You must make your method clear and show the table after each stage. (otal 13 marks). n engineering firm makes motors. hey can make up to five in any one month, but if they make more than four they have to hire additional premises at a cost of 500 per month. hey can store up to two motors for 100 per motor per month. he overhead costs are 00 in any month in which work is done. Motors are delivered to buyers at the end of each month. here are no motors in stock at the beginning of May and there should be none in stock after the eptember delivery. he order book for motors is: Month May June July ugust eptember Number of motors Use dynamic programming to determine the production schedule that minimises the costs, showing your working in the table provided below. tage (month) tate (Number in store at start of month) ction (Number made in month) estinatio n (Number in store at end of month) Value (cost) 3. hree depots,, G and H, supply petrol to three service stations,, and U. he table gives the cost, in pounds, of transporting 1000 litres of petrol from each depot to each service station., G and H have stocks of , and litres respectively., and U require , and litres respectively. he total cost of transporting the petrol is to be minimised. G H U ormulate this problem as a linear programming problem. Make clear your decision variables, objective function and constraints. 4. he following minimising transportation problem is to be solved. (a) (b) J K upply emand 9 11 omplete the table below. J K L upply emand xplain why an extra demand column was added to the table above. possible north-west corner solution is: J K L (otal 8 marks) (c) xplain why it was necessary to place a zero in the first row of the second column. fter three iterations of the stepping-stone method the table becomes: J K L Production schedule 8 1 Month May June July ugust eptember Number to be made otal cost:... (otal 1 marks) (d) aking the most negative improvement index as the entering square for the stepping stone method, solve the transportation problem. You must make your shadow costs and improvement indices clear and demonstrate that your solution is optimal. (11) (otal 16 marks)

18 5. two-person zero-sum game is represented by the following pay-off matrix for player. (a) (b) (c) plays 1 plays plays 3 plays 4 plays plays plays plays Verify that there is no stable solution to this game. xplain why the 4 4 game above may be reduced to the following 3 3 game. ormulate the 3 3 game as a linear programming problem for player. Write the constraints as inequalities. efine your variables clearly. 6. he network in the figure above, shows the distances in km, along the roads between eight towns,,,,,,, G and H. Keith has a shop in each town and needs to visit each one. He wishes to travel a minimum distance and his route should start and finish at. y deleting, a lower bound for the length of the route was found to be 586 km. y deleting, a lower bound for the length of the route was found to be 590 km. (a) (b) y deleting, find another lower bound for the length of the route. tate which is the best lower bound of the three, giving a reason for your answer. (5) y inspection complete the table of least distances. he table can now be taken to represent a complete network. he nearest neighbour algorithm was used to obtain upper bounds for the length of the route: tarting at, an upper bound for the length of the route was found to be 838 km. tarting at, an upper bound for the length of the route was found to be 707 km. (c) tarting at, use the nearest neighbour algorithm to obtain another upper bound for the length of the route. tate which is the best upper bound of the three, giving a reason for your answer G (8) (otal 13 marks) G H G H (otal 13 marks) 7. (a) efine the terms (i) cut, (ii) minimum cut, as applied to a directed network flow. he figure above shows a capacitated directed network and two cuts 1 and. he number on each arc is its capacity. (b) tate the values of the cuts 1 and. Given that one of these two cuts is a minimum cut, (c) (d) find a maximum flow pattern by inspection, and show it on the diagram below. ind a second minimum cut for this network. In order to increase the flow through the network it is decided to add an arc of capacity 100 joining either to or to G. (e) G 19 tate, with a reason, which of these arcs should be added, and the value of the increased flow. (otal 11 marks) G

19 June 006 (adapted for new spec) 1. (a) tate ellman s principle of optimality. (b) (c) xplain what is meant by a minimax route. escribe a practical problem that would require a minimax route as its solution. (otal 4 marks). hree workers, P, Q and R, are to be assigned to three tasks, 1, and 3. ach worker is to be assigned to one task and each task must be assigned to one worker. he cost, in hundreds of pounds, of using each worker for each task is given in the table below. he cost is to be minimised. ost (in 100s) ask 1 ask ask 3 Worker P Worker Q Worker R ormulate the above situation as a linear programming problem, defining the decision variables and making the objective and constraints clear. (otal 7 marks) 3. college wants to offer five full-day activities with a different activity each day from Monday to riday. he sports hall will only be used for these activities. ach evening the caretaker will prepare the hall by putting away the equipment from the previous activity and setting up the hall for the activity next day. On riday evening he will put away the equipment used that day and set up the hall for the following Monday. he 5 activities offered are adminton (), ricket nets (), ancing (), ootball coaching () and ennis (). ach will be on the same day from week to week. he college decides to offer the activities in the order that minimises the total time the caretaker has to spend preparing the hall each week. he hall is initially set up for adminton on Monday. he table below shows the time, in minutes, it will take the caretaker to put away the equipment from one activity and set up the hall for the next. o ime rom possible ordering of activities is (b) (c) (d) Monday uesday Wednesday hursday riday ind the total time taken by the caretaker each week using this ordering. tarting with adminton on Monday, use a suitable algorithm to find an ordering that reduces the total time spent each week to less than 7 hours. y deleting, use a suitable algorithm to find a lower bound for the time taken each week. Make your method clear. (otal 11 marks) 4. uring the school holidays four building tasks, rebuilding a wall (W), repairing the roof (R), repainting the hall (H) and relaying the playground (P), need to be carried out at a Junior chool. our builders,,, and will be hired for these tasks. ach builder must be assigned to one task. uilder is not able to rebuild the wall and therefore cannot be assigned to this task. he cost, in thousands of pounds, of using each builder for each task is given in the table below. (a) (b) ost H P R W Use the Hungarian algorithm, reducing rows first, to obtain an allocation that minimises the total cost. tate the allocation and its total cost. You must make your method clear and show the table after each stage. tate, with a reason, whether this allocation is unique. (9) (otal 11 marks) (a) xplain why this problem is equivalent to the travelling salesman problem.

20 5. Victor owns some kiosks selling ice cream, hot dogs and soft drinks. he network below shows the choices of action and the profits, in thousands of pounds, they generate over the next four years. he negative numbers indicate losses due to the purchases of new kiosks. Use a suitable algorithm to determine the sequence of actions so that the profit over the four years is maximised and state this maximum profit. (otal 1 marks) 6. (a) xplain briefly the circumstances under which a degenerate feasible solution may occur to a transportation problem. (b) xplain why a dummy location may be needed when solving a transportation problem. he table below shows the cost of transporting one unit of stock from each of three supply points, and to each of two demand points 1 and. It also shows the stock held at each supply point and the stock required at each demand point. (c) upply emand omplete the table below to show a possible initial feasible solution generated by the north-west corner method G J K I H (d) Use the stepping-stone method to obtain an optimal solution and state its cost. You should make your method clear by stating shadow costs, improvement indices, stepping-stone route, and the entering and exiting squares at each stage. (10) (otal 14 marks) 7. two person zero-sum game is represented by the following pay-off matrix for player. (a) (b) (c) (d) plays 1 plays plays 3 plays plays plays ormulate the game as a linear programming problem for player, writing the constraints as equalities and clearly defining your variables. xplain why it is necessary to use the simplex algorithm to solve this game theory problem. Write down an initial simplex tableau making your variables clear. Perform two complete iterations of the simplex algorithm, indicating your pivots and stating the row operations that you use. (8) (otal 16 marks) 8. he tableau below is the initial tableau for a maximising linear programming problem. (a) (b) (c) asic variable x y z r s t Value r s t P Write down the four equations represented in the initial tableau above. aking the most negative number in the profit row to indicate the pivot column at each stage, solve this linear programming problem. tate the row operations that you use. tate the values of the objective function and each variable. (5) (9) (otal 16 marks) 1 3 0

21 b.v. x y z r s t Value Row Operations b.v. x y z r s t Value Row Operations b.v. x y z r s t Value Row Operations he figure above shows a capacitated, directed network. he capacity of each arc is shown on each arc. he numbers in circles represent an initial flow from to. wo cuts 1 and are shown on the figure. (a) Write down the capacity of each of the two cuts and the value of the initial flow. (b) omplete the initialisation of the labelling procedure on the diagram below by entering values along arcs,, and. b.v. x y z r s t Value Row Operations b.v. x y z r s t Value Row Operations

22 (d) how your maximal flow pattern on the diagram below. (e) Prove that your flow is maximal. (otal 14 marks) (c) Hence use the labelling procedure to find a maximal flow through the network. You must list each flow-augmenting path you use, together with its flow. (5)

23 G G G cutting stitching fillingdressing cutting stitching filling dressing G G

24 G I K L G J I K L H J H

25 G H I J KL xyz P x y z r s t r s t P

26 PM

27 008 (adapted for new spec) x (c) Use the north-west corner rule to obtain a possible pattern of distribution. (d) aking the most negative improvement index to indicate the entering square, use the stepping-stone method to obtain an optimal solution. You must make your shadow costs and improvement indices clear and demonstrate that your solution is optimal. (7) (e) tate the cost of your optimal solution. (otal 13 marks) 4. (a) xplain the difference between a maximin route and a minimax route in dynamic programming y he diagram above shows a capacitated, directed network of pipes. he number on each arc represents the capacity of that pipe. he numbers in circles represent a feasible flow. (a) tate the values of x and y. (b) (c) List the saturated arcs. tate the value of the feasible flow. (d) tate the capacities of the cuts 1,, and 3. (e) (f) y inspection, find a flow-augmenting route to increase the flow by one unit. You must state your route. Prove that the new flow is maximal.. xplain what is meant, in a network, by (a) a walk, (b) a tour. (otal 11 marks) (otal 4 marks) 3. Jameson cars are made in two factories and. ales have been made at the two main showrooms in London and dinburgh. ars are to be transported from the factories to the showrooms. he table below shows the cost, in pounds, of transporting one car from each factory to each showroom. It also shows the number of cars available at each factory and the number required at each showroom. London (L) dinburgh () upply emand maximin route from L to R is to be found through the staged network shown above. (b) Use dynamic programming to complete a table below and hence find a maximin route. (10) (otal 1 marks) 5. (a) In game theory, explain the circumstances under which column (x) dominates column (y) in a two-person zero-sum game. Liz and Mark play a zero-sum game. his game is represented by the following pay-off matrix for Liz. Mark plays 1 Mark plays Mark plays 3 Liz plays Liz plays Liz plays (b) Verify that there is no stable solution to this game. (c) ind the best strategy for Liz and the value of the game to her. (9) he game now changes so that when Liz plays 1 and Mark plays 3 the pay-off to Liz changes from to 4. ll other pay-offs for this zero-sum game remain the same. (d) xplain why a graphical approach is no longer possible and briefly describe the method Liz should use to determine her best strategy. (otal 16 marks) It is decided to use the transportation algorithm to obtain a minimal cost solution. (a) (b) xplain why it is necessary to add a dummy demand point. omplete the table below. L ummy upply emand our salespersons, Joe, Min-eong, Olivia and Robert, are to attend four business fairs,,, and. ach salesperson must attend just one fair and each fair must be attended by just one salesperson. he expected sales, in thousands of pounds, that each salesperson would make at each fair is shown in the table below. Joe Min-eong Olivia Robert

28 7. (a) Use the Hungarian algorithm, reducing rows first, to obtain an allocation that maximises the total expected sales from the four salespersons. You must make your method clear and show the table after each stage. (b) tate all possible optimal allocations and the optimal total value. (10) (otal 14 marks) b.v. x y z r s t Value Row operations P b.v. x y z r s t Value Row operations he network in the diagram above shows the distances, in km, between eight weather data collection points. tarting and finishing at, lice needs to visit each collection point at least once, in a minimum distance. (a) Obtain a minimum spanning tree for the network using Kruskal s algorithm, stating the order in which you select the arcs. (b) Use your answer to part (a) to determine an initial upper bound for the length of the route. (c) tarting from your initial upper bound use short cuts to find an upper bound, which is below 630km. tate the corresponding route. (d) Use the nearest neighbour algorithm starting at to find a second upper bound for the length of the route. (e) y deleting, and all of its arcs, find a lower bound for the length of the route. (f) Use your results to write down the smallest interval which you are confident contains the optimal length of the route. (otal 16 marks) 8. he tableau below is the initial tableau for a maximising linear programming problem in x, y and z. asic variable x y z r s t Value 7 5 r s t P P b.v. x y z r s t Value Row operations P b.v. x y z r s t Value Row operations P (a) aking the most negative number in the profit row to indicate the pivot column at each stage, perform two complete iterations of the simplex algorithm. tate the row operations you use. You may not need to use all of these tableaux. (b) xplain how you know that your solution is not optimal. (9) (otal 10 marks)

29 Write your answers in the answer book for this paper. Paper Reference(s) 6690/01 dexcel G ecision Mathematics dvanced/dvanced ubsidiary Monday 1 June 009 Morning ime: 1 hour 30 minutes Materials required for examination Nil Items included with question papers nswer ook andidates may use any calculator allowed by the regulations of the Joint ouncil for Qualifications. alculators must not have the facility for symbolic algebra manipulation, differentiation and integration, or have retrievable mathematical formulae stored in them. 1. company, Kleenitquick, has developed a new stain remover. o promote sales, three salespersons, Jess, Matt and Rachel, will be assigned to three of four department stores 1,, 3 and 4, to demonstrate the stain remover. ach salesperson can only be assigned to one department store. he table below shows the cost, in pounds, of assigning each salesperson to each department store Jess Matt Rachel (a) xplain why a dummy row needs to be added to the table. (b) omplete able 1 in the answer book. (c) Reducing rows first, use the Hungarian algorithm to obtain an allocation that minimises the cost of assigning salespersons to department stores. You must make your method clear and show the table after each iteration. (6) Instructions to andidates Write your answers for this paper in the answer book provided. In the boxes on the answer book, write your centre number, candidate number, your surname, initials and signature. heck that you have the correct question paper. nswer LL the questions. When a calculator is used, the answer should be given to an appropriate degree of accuracy. o not return the question paper with the answer book. Information for andidates ull marks may be obtained for answers to LL questions. he marks for individual questions and the parts of questions are shown in round brackets: e.g.. here are 8 questions in this question paper. he total mark for this question paper is 75. here are 8 pages in this question paper. he answer book has 16 pages. ny blank pages are indicated. dvice to andidates You must ensure that your answers to parts of questions are clearly labelled. You should show sufficient working to make your methods clear to the xaminer. nswers without working may not gain full credit. (d) ind the minimum cost. (otal 9 marks) Printer s Log. No. M3484 W850/R6690/ /5/4/3 *M3484* his publication may be reproduced only in accordance with dexcel Limited copyright policy. 009 dexcel Limited. urn over M3484

30 . (a) xplain the difference between the classical and the practical travelling salesperson problems. he table below shows the distances, in km, between six data collection points,,,,,, and Rachel must visit each collection point. he will start and finish at and wishes to minimise the total distance travelled. 3. two-person zero-sum game is represented by the following pay-off matrix for player. plays 1 plays plays 3 plays plays plays (a) Verify that there is no stable solution to this game. (b) Reduce the game so that player has a choice of only two actions. (c) Write down the reduced pay-off matrix for player. (d) ind the best strategy for player and the value of the game to player. (7) (b) tarting at, use the nearest neighbour algorithm to obtain an upper bound. Make your method clear. (otal 13 marks) tarting at, a second upper bound of 93 km was found. (c) tate the better upper bound of these two, giving a reason for your answer. y deleting, a lower bound was found to be 45 km. (d) y deleting, find a second lower bound. Make your method clear. (e) tate the better lower bound of these two, giving a reason for your answer. (f) aking your answers to (c) and (e), use inequalities to write down an interval that must contain the length of Rachel s optimal route. (otal 1 marks) M urn over M3484 4

31 4. 5. While solving a maximising linear programming problem, the following tableau was obtained G asic Variable x y z r s t value z s t P (a) Write down the values of x, y and z as indicated by this tableau. (b) Write down the profit equation from the tableau. 1 igure 1 (otal 4 marks) igure 1 shows a capacitated network. he capacity of each arc is shown on the arc. he numbers in circles represent an initial flow from to. wo cuts 1 and are shown in igure 1. (a) ind the capacity of each of the two cuts. (b) ind the maximum flow through the network. You must list each flow-augmenting route you use together with its flow. (otal 5 marks) M urn over M3484 6

Given a directed graph G =(N A), where N is a set of m nodes and A. destination node, implying a direction for ow to follow. Arcs have limitations

Given a directed graph G =(N A), where N is a set of m nodes and A. destination node, implying a direction for ow to follow. Arcs have limitations 4 Interior point algorithms for network ow problems Mauricio G.C. Resende AT&T Bell Laboratories, Murray Hill, NJ 07974-2070 USA Panos M. Pardalos The University of Florida, Gainesville, FL 32611-6595

More information

Paper Reference. Edexcel GCSE Mathematics (Linear) 1380 Paper 1 (Non-Calculator) Foundation Tier. Monday 6 June 2011 Afternoon Time: 1 hour 30 minutes

Paper Reference. Edexcel GCSE Mathematics (Linear) 1380 Paper 1 (Non-Calculator) Foundation Tier. Monday 6 June 2011 Afternoon Time: 1 hour 30 minutes Centre No. Candidate No. Paper Reference 1 3 8 0 1 F Paper Reference(s) 1380/1F Edexcel GCSE Mathematics (Linear) 1380 Paper 1 (Non-Calculator) Foundation Tier Monday 6 June 2011 Afternoon Time: 1 hour

More information

Probability and Game Theory Course Syllabus

Probability and Game Theory Course Syllabus Probability and Game Theory Course Syllabus DATE ACTIVITY CONCEPT Sunday Learn names; introduction to course, introduce the Battle of the Bismarck Sea as a 2-person zero-sum game. Monday Day 1 Pre-test

More information

Functional English 47251

Functional English 47251 entre Number andidate Number For Examiner s Use Surname Other Names andidate Signature Examiner s Initials Functional Skills ertificate November 2014 Functional English 47251 omponent 1 Reading Level 2

More information

AN EXAMPLE OF THE GOMORY CUTTING PLANE ALGORITHM. max z = 3x 1 + 4x 2. 3x 1 x x x x N 2

AN EXAMPLE OF THE GOMORY CUTTING PLANE ALGORITHM. max z = 3x 1 + 4x 2. 3x 1 x x x x N 2 AN EXAMPLE OF THE GOMORY CUTTING PLANE ALGORITHM Consider the integer programme subject to max z = 3x 1 + 4x 2 3x 1 x 2 12 3x 1 + 11x 2 66 The first linear programming relaxation is subject to x N 2 max

More information

Math 1313 Section 2.1 Example 2: Given the following Linear Program, Determine the vertices of the feasible set. Subject to:

Math 1313 Section 2.1 Example 2: Given the following Linear Program, Determine the vertices of the feasible set. Subject to: Math 1313 Section 2.1 Example 2: Given the following Linear Program, Determine the vertices of the feasible set Subject to: Min D 3 = 3x + y 10x + 2y 84 8x + 4y 120 x, y 0 3 Math 1313 Section 2.1 Popper

More information

Decision Analysis. Decision-Making Problem. Decision Analysis. Part 1 Decision Analysis and Decision Tables. Decision Analysis, Part 1

Decision Analysis. Decision-Making Problem. Decision Analysis. Part 1 Decision Analysis and Decision Tables. Decision Analysis, Part 1 Decision Support: Decision Analysis Jožef Stefan International Postgraduate School, Ljubljana Programme: Information and Communication Technologies [ICT3] Course Web Page: http://kt.ijs.si/markobohanec/ds/ds.html

More information

An Introduction to Simio for Beginners

An Introduction to Simio for Beginners An Introduction to Simio for Beginners C. Dennis Pegden, Ph.D. This white paper is intended to introduce Simio to a user new to simulation. It is intended for the manufacturing engineer, hospital quality

More information

GCSE Mathematics B (Linear) Mark Scheme for November Component J567/04: Mathematics Paper 4 (Higher) General Certificate of Secondary Education

GCSE Mathematics B (Linear) Mark Scheme for November Component J567/04: Mathematics Paper 4 (Higher) General Certificate of Secondary Education GCSE Mathematics B (Linear) Component J567/04: Mathematics Paper 4 (Higher) General Certificate of Secondary Education Mark Scheme for November 2014 Oxford Cambridge and RSA Examinations OCR (Oxford Cambridge

More information

Functional Maths Skills Check E3/L x

Functional Maths Skills Check E3/L x Functional Maths Skills Check E3/L1 Name: Date started: The Four Rules of Number + - x May 2017. Kindly contributed by Nicola Smith, Gloucestershire College. Search for Nicola on skillsworkshop.org Page

More information

Measures of the Location of the Data

Measures of the Location of the Data OpenStax-CNX module m46930 1 Measures of the Location of the Data OpenStax College This work is produced by OpenStax-CNX and licensed under the Creative Commons Attribution License 3.0 The common measures

More information

Paper 2. Mathematics test. Calculator allowed. First name. Last name. School KEY STAGE TIER

Paper 2. Mathematics test. Calculator allowed. First name. Last name. School KEY STAGE TIER 259574_P2 5-7_KS3_Ma.qxd 1/4/04 4:14 PM Page 1 Ma KEY STAGE 3 TIER 5 7 2004 Mathematics test Paper 2 Calculator allowed Please read this page, but do not open your booklet until your teacher tells you

More information

Mathematics Success Level E

Mathematics Success Level E T403 [OBJECTIVE] The student will generate two patterns given two rules and identify the relationship between corresponding terms, generate ordered pairs, and graph the ordered pairs on a coordinate plane.

More information

EDEXCEL FUNCTIONAL SKILLS PILOT TEACHER S NOTES. Maths Level 2. Chapter 4. Working with measures

EDEXCEL FUNCTIONAL SKILLS PILOT TEACHER S NOTES. Maths Level 2. Chapter 4. Working with measures EDEXCEL FUNCTIONAL SKILLS PILOT TEACHER S NOTES Maths Level 2 Chapter 4 Working with measures SECTION G 1 Time 2 Temperature 3 Length 4 Weight 5 Capacity 6 Conversion between metric units 7 Conversion

More information

Polish (JUN ) General Certificate of Secondary Education June 2014

Polish (JUN ) General Certificate of Secondary Education June 2014 entre Number Surname andidate Number For Examiner s Use Other Names andidate Signature Examiner s Initials Page Mark General ertificate of Secondary Education June 2014 Polish 46851 Unit 1 Listening Friday

More information

Lesson 12. Lesson 12. Suggested Lesson Structure. Round to Different Place Values (6 minutes) Fluency Practice (12 minutes)

Lesson 12. Lesson 12. Suggested Lesson Structure. Round to Different Place Values (6 minutes) Fluency Practice (12 minutes) Objective: Solve multi-step word problems using the standard addition reasonableness of answers using rounding. Suggested Lesson Structure Fluency Practice Application Problems Concept Development Student

More information

Minutes of Loose Primary School PTA Committee Meeting. Wednesday 15 th July 2015

Minutes of Loose Primary School PTA Committee Meeting. Wednesday 15 th July 2015 Minutes of Loose Primary School PTA Committee Meeting Wednesday 15 th July 2015 Present: Rachel Hargrave Lee Drewnicki Sam Hilder Kevin Hatter Michelle Garrett Lucy Dewar Sonia Nunn Linda Bremerkamp Gena

More information

Functional Skills Mathematics Level 2 sample assessment

Functional Skills Mathematics Level 2 sample assessment Functional Skills Mathematics Level 2 sample assessment Sample paper 3 Candidate Name (First, Middle, Last) www.cityandguilds.com May 2015 Version 1-3 Total marks Task Mark Candidate enrolment number DOB

More information

Stacks Teacher notes. Activity description. Suitability. Time. AMP resources. Equipment. Key mathematical language. Key processes

Stacks Teacher notes. Activity description. Suitability. Time. AMP resources. Equipment. Key mathematical language. Key processes Stacks Teacher notes Activity description (Interactive not shown on this sheet.) Pupils start by exploring the patterns generated by moving counters between two stacks according to a fixed rule, doubling

More information

Objective: Add decimals using place value strategies, and relate those strategies to a written method.

Objective: Add decimals using place value strategies, and relate those strategies to a written method. NYS COMMON CORE MATHEMATICS CURRICULUM Lesson 9 5 1 Lesson 9 Objective: Add decimals using place value strategies, and relate those strategies to a written method. Suggested Lesson Structure Fluency Practice

More information

University of Groningen. Systemen, planning, netwerken Bosman, Aart

University of Groningen. Systemen, planning, netwerken Bosman, Aart University of Groningen Systemen, planning, netwerken Bosman, Aart IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF) if you wish to cite from it. Please check the document

More information

Mathematics (JUN14MS0401) General Certificate of Education Advanced Level Examination June Unit Statistics TOTAL.

Mathematics (JUN14MS0401) General Certificate of Education Advanced Level Examination June Unit Statistics TOTAL. Centre Number Candidate Number For Examiner s Use Surname Other Names Candidate Signature Examiner s Initials Mathematics Unit Statistics 4 Tuesday 24 June 2014 General Certificate of Education Advanced

More information

Visit us at:

Visit us at: White Paper Integrating Six Sigma and Software Testing Process for Removal of Wastage & Optimizing Resource Utilization 24 October 2013 With resources working for extended hours and in a pressurized environment,

More information

Hardhatting in a Geo-World

Hardhatting in a Geo-World Hardhatting in a Geo-World TM Developed and Published by AIMS Education Foundation This book contains materials developed by the AIMS Education Foundation. AIMS (Activities Integrating Mathematics and

More information

Leader s Guide: Dream Big and Plan for Success

Leader s Guide: Dream Big and Plan for Success Leader s Guide: Dream Big and Plan for Success The goal of this lesson is to: Provide a process for Managers to reflect on their dream and put it in terms of business goals with a plan of action and weekly

More information

Module 12. Machine Learning. Version 2 CSE IIT, Kharagpur

Module 12. Machine Learning. Version 2 CSE IIT, Kharagpur Module 12 Machine Learning 12.1 Instructional Objective The students should understand the concept of learning systems Students should learn about different aspects of a learning system Students should

More information

The following shows how place value and money are related. ones tenths hundredths thousandths

The following shows how place value and money are related. ones tenths hundredths thousandths 2-1 The following shows how place value and money are related. ones tenths hundredths thousandths (dollars) (dimes) (pennies) (tenths of a penny) Write each fraction as a decimal and then say it. 1. 349

More information

SOCIAL STUDIES GRADE 1. Clear Learning Targets Office of Teaching and Learning Curriculum Division FAMILIES NOW AND LONG AGO, NEAR AND FAR

SOCIAL STUDIES GRADE 1. Clear Learning Targets Office of Teaching and Learning Curriculum Division FAMILIES NOW AND LONG AGO, NEAR AND FAR SOCIAL STUDIES FAMILIES NOW AND LONG AGO, NEAR AND FAR GRADE 1 Clear Learning Targets 2015-2016 Aligned with Ohio s Learning Standards for Social Studies Office of Teaching and Learning Curriculum Division

More information

Page 1 of 11. Curriculum Map: Grade 4 Math Course: Math 4 Sub-topic: General. Grade(s): None specified

Page 1 of 11. Curriculum Map: Grade 4 Math Course: Math 4 Sub-topic: General. Grade(s): None specified Curriculum Map: Grade 4 Math Course: Math 4 Sub-topic: General Grade(s): None specified Unit: Creating a Community of Mathematical Thinkers Timeline: Week 1 The purpose of the Establishing a Community

More information

Appendix L: Online Testing Highlights and Script

Appendix L: Online Testing Highlights and Script Online Testing Highlights and Script for Fall 2017 Ohio s State Tests Administrations Test administrators must use this document when administering Ohio s State Tests online. It includes step-by-step directions,

More information

OPTIMIZATINON OF TRAINING SETS FOR HEBBIAN-LEARNING- BASED CLASSIFIERS

OPTIMIZATINON OF TRAINING SETS FOR HEBBIAN-LEARNING- BASED CLASSIFIERS OPTIMIZATINON OF TRAINING SETS FOR HEBBIAN-LEARNING- BASED CLASSIFIERS Václav Kocian, Eva Volná, Michal Janošek, Martin Kotyrba University of Ostrava Department of Informatics and Computers Dvořákova 7,

More information

Mathematics process categories

Mathematics process categories Mathematics process categories All of the UK curricula define multiple categories of mathematical proficiency that require students to be able to use and apply mathematics, beyond simple recall of facts

More information

Functional Skills Mathematics Level 2 assessment

Functional Skills Mathematics Level 2 assessment Functional Skills Mathematics Level 2 assessment www.cityandguilds.com September 2015 Version 1.0 Marking scheme ONLINE V2 Level 2 Sample Paper 4 Mark Represent Analyse Interpret Open Fixed S1Q1 3 3 0

More information

Qualification handbook

Qualification handbook Qualification handbook BIIAB Level 3 Award in 601/5960/1 Version 1 April 2015 Table of Contents 1. About the BIIAB Level 3 Award in... 1 2. About this pack... 2 3. BIIAB Customer Service... 2 4. What are

More information

Backwards Numbers: A Study of Place Value. Catherine Perez

Backwards Numbers: A Study of Place Value. Catherine Perez Backwards Numbers: A Study of Place Value Catherine Perez Introduction I was reaching for my daily math sheet that my school has elected to use and in big bold letters in a box it said: TO ADD NUMBERS

More information

Airplane Rescue: Social Studies. LEGO, the LEGO logo, and WEDO are trademarks of the LEGO Group The LEGO Group.

Airplane Rescue: Social Studies. LEGO, the LEGO logo, and WEDO are trademarks of the LEGO Group The LEGO Group. Airplane Rescue: Social Studies LEGO, the LEGO logo, and WEDO are trademarks of the LEGO Group. 2010 The LEGO Group. Lesson Overview The students will discuss ways that people use land and their physical

More information

ACTIVITY: Comparing Combination Locks

ACTIVITY: Comparing Combination Locks 5.4 Compound Events outcomes of one or more events? ow can you find the number of possible ACIVIY: Comparing Combination Locks Work with a partner. You are buying a combination lock. You have three choices.

More information

STUDENT MOODLE ORIENTATION

STUDENT MOODLE ORIENTATION BAKER UNIVERSITY SCHOOL OF PROFESSIONAL AND GRADUATE STUDIES STUDENT MOODLE ORIENTATION TABLE OF CONTENTS Introduction to Moodle... 2 Online Aptitude Assessment... 2 Moodle Icons... 6 Logging In... 8 Page

More information

Getting Started with MOODLE

Getting Started with MOODLE Getting Started with MOODLE Setting up your class. You see this menu, the students do not. Here you can choose the backgrounds for your class, enroll and unenroll students, create groups, upload files,

More information

MODULE FRAMEWORK AND ASSESSMENT SHEET

MODULE FRAMEWORK AND ASSESSMENT SHEET MODULE FRAMEWORK AND ASSESSMENT SHEET LEARNING OUTCOMES (LOS) ASSESSMENT STANDARDS (ASS) FORMATIVE ASSESSMENT ASs Pages and (mark out of ) LOs (ave. out of ) SUMMATIVE ASSESSMENT Tasks or tests Ave for

More information

BADM 641 (sec. 7D1) (on-line) Decision Analysis August 16 October 6, 2017 CRN: 83777

BADM 641 (sec. 7D1) (on-line) Decision Analysis August 16 October 6, 2017 CRN: 83777 BADM 641 (sec. 7D1) (on-line) Decision Analysis August 16 October 6, 2017 CRN: 83777 SEMESTER: Fall 2017 INSTRUCTOR: Jack Fuller, Ph.D. OFFICE: 108 Business and Economics Building, West Virginia University,

More information

Focus of the Unit: Much of this unit focuses on extending previous skills of multiplication and division to multi-digit whole numbers.

Focus of the Unit: Much of this unit focuses on extending previous skills of multiplication and division to multi-digit whole numbers. Approximate Time Frame: 3-4 weeks Connections to Previous Learning: In fourth grade, students fluently multiply (4-digit by 1-digit, 2-digit by 2-digit) and divide (4-digit by 1-digit) using strategies

More information

Houghton Mifflin Online Assessment System Walkthrough Guide

Houghton Mifflin Online Assessment System Walkthrough Guide Houghton Mifflin Online Assessment System Walkthrough Guide Page 1 Copyright 2007 by Houghton Mifflin Company. All Rights Reserved. No part of this document may be reproduced or transmitted in any form

More information

Measurement. Time. Teaching for mastery in primary maths

Measurement. Time. Teaching for mastery in primary maths Measurement Time Teaching for mastery in primary maths Contents Introduction 3 01. Introduction to time 3 02. Telling the time 4 03. Analogue and digital time 4 04. Converting between units of time 5 05.

More information

A 1,200 B 1,300 C 1,500 D 1,700

A 1,200 B 1,300 C 1,500 D 1,700 North arolina Testing Program EOG Mathematics Grade Sample Items Goal. There are eighty-six thousand four hundred seconds in a day. How else could this number be written? 80,06. Jenny s vacation money

More information

Radius STEM Readiness TM

Radius STEM Readiness TM Curriculum Guide Radius STEM Readiness TM While today s teens are surrounded by technology, we face a stark and imminent shortage of graduates pursuing careers in Science, Technology, Engineering, and

More information

Numeracy Medium term plan: Summer Term Level 2C/2B Year 2 Level 2A/3C

Numeracy Medium term plan: Summer Term Level 2C/2B Year 2 Level 2A/3C Numeracy Medium term plan: Summer Term Level 2C/2B Year 2 Level 2A/3C Using and applying mathematics objectives (Problem solving, Communicating and Reasoning) Select the maths to use in some classroom

More information

Algebra 2- Semester 2 Review

Algebra 2- Semester 2 Review Name Block Date Algebra 2- Semester 2 Review Non-Calculator 5.4 1. Consider the function f x 1 x 2. a) Describe the transformation of the graph of y 1 x. b) Identify the asymptotes. c) What is the domain

More information

Student s Edition. Grade 6 Unit 6. Statistics. Eureka Math. Eureka Math

Student s Edition. Grade 6 Unit 6. Statistics. Eureka Math. Eureka Math Student s Edition Grade 6 Unit 6 Statistics Eureka Math Eureka Math Lesson 1 Lesson 1: Posing Statistical Questions Statistics is about using data to answer questions. In this module, the following four

More information

Curriculum Design Project with Virtual Manipulatives. Gwenanne Salkind. George Mason University EDCI 856. Dr. Patricia Moyer-Packenham

Curriculum Design Project with Virtual Manipulatives. Gwenanne Salkind. George Mason University EDCI 856. Dr. Patricia Moyer-Packenham Curriculum Design Project with Virtual Manipulatives Gwenanne Salkind George Mason University EDCI 856 Dr. Patricia Moyer-Packenham Spring 2006 Curriculum Design Project with Virtual Manipulatives Table

More information

Diagnostic Test. Middle School Mathematics

Diagnostic Test. Middle School Mathematics Diagnostic Test Middle School Mathematics Copyright 2010 XAMonline, Inc. All rights reserved. No part of the material protected by this copyright notice may be reproduced or utilized in any form or by

More information

EDEXCEL FUNCTIONAL SKILLS PILOT. Maths Level 2. Chapter 7. Working with probability

EDEXCEL FUNCTIONAL SKILLS PILOT. Maths Level 2. Chapter 7. Working with probability Working with probability 7 EDEXCEL FUNCTIONAL SKILLS PILOT Maths Level 2 Chapter 7 Working with probability SECTION K 1 Measuring probability 109 2 Experimental probability 111 3 Using tables to find the

More information

Office of Planning and Budgets. Provost Market for Fiscal Year Resource Guide

Office of Planning and Budgets. Provost Market for Fiscal Year Resource Guide Office of Planning and Budgets Provost Market for Fiscal Year 2017-18 Resource Guide This resource guide will show users how to operate the Cognos Planning application used to collect Provost Market raise

More information

TCC Jim Bolen Math Competition Rules and Facts. Rules:

TCC Jim Bolen Math Competition Rules and Facts. Rules: TCC Jim Bolen Math Competition Rules and Facts Rules: The Jim Bolen Math Competition is composed of two one hour multiple choice pre-calculus tests. The first test is scheduled on Friday, November 8, 2013

More information

Cal s Dinner Card Deals

Cal s Dinner Card Deals Cal s Dinner Card Deals Overview: In this lesson students compare three linear functions in the context of Dinner Card Deals. Students are required to interpret a graph for each Dinner Card Deal to help

More information

MTH 141 Calculus 1 Syllabus Spring 2017

MTH 141 Calculus 1 Syllabus Spring 2017 Instructor: Section/Meets Office Hrs: Textbook: Calculus: Single Variable, by Hughes-Hallet et al, 6th ed., Wiley. Also needed: access code to WileyPlus (included in new books) Calculator: Not required,

More information

AGS THE GREAT REVIEW GAME FOR PRE-ALGEBRA (CD) CORRELATED TO CALIFORNIA CONTENT STANDARDS

AGS THE GREAT REVIEW GAME FOR PRE-ALGEBRA (CD) CORRELATED TO CALIFORNIA CONTENT STANDARDS AGS THE GREAT REVIEW GAME FOR PRE-ALGEBRA (CD) CORRELATED TO CALIFORNIA CONTENT STANDARDS 1 CALIFORNIA CONTENT STANDARDS: Chapter 1 ALGEBRA AND WHOLE NUMBERS Algebra and Functions 1.4 Students use algebraic

More information

BMBF Project ROBUKOM: Robust Communication Networks

BMBF Project ROBUKOM: Robust Communication Networks BMBF Project ROBUKOM: Robust Communication Networks Arie M.C.A. Koster Christoph Helmberg Andreas Bley Martin Grötschel Thomas Bauschert supported by BMBF grant 03MS616A: ROBUKOM Robust Communication Networks,

More information

FOR TEACHERS ONLY RATING GUIDE BOOKLET 1 OBJECTIVE AND CONSTRUCTED RESPONSE JUNE 1 2, 2005

FOR TEACHERS ONLY RATING GUIDE BOOKLET 1 OBJECTIVE AND CONSTRUCTED RESPONSE JUNE 1 2, 2005 FOR TEACHERS ONLY THE UNIVERSITY OF THE STATE OF NEW YORK GRADE 8 INTERMEDIATE-LEVEL TEST SOCIAL STUDIES RATING GUIDE BOOKLET 1 OBJECTIVE AND CONSTRUCTED RESPONSE JUNE 1 2, 2005 Updated information regarding

More information

21st CENTURY SKILLS IN 21-MINUTE LESSONS. Using Technology, Information, and Media

21st CENTURY SKILLS IN 21-MINUTE LESSONS. Using Technology, Information, and Media 21st CENTURY SKILLS IN 21-MINUTE LESSONS Using Technology, Information, and Media T Copyright 2011 by Saddleback Educational Publishing. All rights reserved. No part of this book may be reproduced in any

More information

Multiplication of 2 and 3 digit numbers Multiply and SHOW WORK. EXAMPLE. Now try these on your own! Remember to show all work neatly!

Multiplication of 2 and 3 digit numbers Multiply and SHOW WORK. EXAMPLE. Now try these on your own! Remember to show all work neatly! Multiplication of 2 and digit numbers Multiply and SHOW WORK. EXAMPLE 205 12 10 2050 2,60 Now try these on your own! Remember to show all work neatly! 1. 6 2 2. 28 8. 95 7. 82 26 5. 905 15 6. 260 59 7.

More information

Work Stations 101: Grades K-5 NCTM Regional Conference &

Work Stations 101: Grades K-5 NCTM Regional Conference & : Grades K-5 NCTM Regional Conference 11.20.14 & 11.21.14 Janet (Dodd) Nuzzie, Pasadena ISD District Instructional Specialist, K-4 President, Texas Association of Supervisors of jdodd@pasadenaisd.org PISD

More information

STUDYING RULES For the first study cycle at International Burch University

STUDYING RULES For the first study cycle at International Burch University INTERNATIONAL BURCH UNIVERSITY SENATE Number: 338 08 IBU STUDYING RULES For the first study cycle at International Burch University GENERAL REGULATIONS Article 1. With these rules defined are the organization

More information

Answer Key For The California Mathematics Standards Grade 1

Answer Key For The California Mathematics Standards Grade 1 Introduction: Summary of Goals GRADE ONE By the end of grade one, students learn to understand and use the concept of ones and tens in the place value number system. Students add and subtract small numbers

More information

Ohio s Learning Standards-Clear Learning Targets

Ohio s Learning Standards-Clear Learning Targets Ohio s Learning Standards-Clear Learning Targets Math Grade 1 Use addition and subtraction within 20 to solve word problems involving situations of 1.OA.1 adding to, taking from, putting together, taking

More information

Pre-Algebra A. Syllabus. Course Overview. Course Goals. General Skills. Credit Value

Pre-Algebra A. Syllabus. Course Overview. Course Goals. General Skills. Credit Value Syllabus Pre-Algebra A Course Overview Pre-Algebra is a course designed to prepare you for future work in algebra. In Pre-Algebra, you will strengthen your knowledge of numbers as you look to transition

More information

Prerequisite: General Biology 107 (UE) and 107L (UE) with a grade of C- or better. Chemistry 118 (UE) and 118L (UE) or permission of instructor.

Prerequisite: General Biology 107 (UE) and 107L (UE) with a grade of C- or better. Chemistry 118 (UE) and 118L (UE) or permission of instructor. Introduction to Molecular and Cell Biology BIOL 499-02 Fall 2017 Class time: Lectures: Tuesday, Thursday 8:30 am 9:45 am Location: Name of Faculty: Contact details: Laboratory: 2:00 pm-4:00 pm; Monday

More information

Grade 8: Module 4: Unit 1: Lesson 8 Reading for Gist and Answering Text-Dependent Questions: Local Sustainable Food Chain

Grade 8: Module 4: Unit 1: Lesson 8 Reading for Gist and Answering Text-Dependent Questions: Local Sustainable Food Chain Grade 8: Module 4: Unit 1: Lesson 8 Reading for Gist and Answering Text-Dependent Questions: This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License. Exempt

More information

Extending Place Value with Whole Numbers to 1,000,000

Extending Place Value with Whole Numbers to 1,000,000 Grade 4 Mathematics, Quarter 1, Unit 1.1 Extending Place Value with Whole Numbers to 1,000,000 Overview Number of Instructional Days: 10 (1 day = 45 minutes) Content to Be Learned Recognize that a digit

More information

Multimedia Application Effective Support of Education

Multimedia Application Effective Support of Education Multimedia Application Effective Support of Education Eva Milková Faculty of Science, University od Hradec Králové, Hradec Králové, Czech Republic eva.mikova@uhk.cz Abstract Multimedia applications have

More information

Mathematics Success Grade 7

Mathematics Success Grade 7 T894 Mathematics Success Grade 7 [OBJECTIVE] The student will find probabilities of compound events using organized lists, tables, tree diagrams, and simulations. [PREREQUISITE SKILLS] Simple probability,

More information

Math Grade 3 Assessment Anchors and Eligible Content

Math Grade 3 Assessment Anchors and Eligible Content Math Grade 3 Assessment Anchors and Eligible Content www.pde.state.pa.us 2007 M3.A Numbers and Operations M3.A.1 Demonstrate an understanding of numbers, ways of representing numbers, relationships among

More information

Arizona s College and Career Ready Standards Mathematics

Arizona s College and Career Ready Standards Mathematics Arizona s College and Career Ready Mathematics Mathematical Practices Explanations and Examples First Grade ARIZONA DEPARTMENT OF EDUCATION HIGH ACADEMIC STANDARDS FOR STUDENTS State Board Approved June

More information

Leisure and Tourism. Content

Leisure and Tourism. Content Leisure and Tourism The National Railway Museum is part of a family of museums called the Science Museum Group (SMG) that includes: Science Museum, London Museum of Science and Industry, Manchester National

More information

Course Syllabus for Math

Course Syllabus for Math Course Syllabus for Math 1090-003 Instructor: Stefano Filipazzi Class Time: Mondays, Wednesdays and Fridays, 9.40 a.m. - 10.30 a.m. Class Place: LCB 225 Office hours: Wednesdays, 2.00 p.m. - 3.00 p.m.,

More information

Montana's Distance Learning Policy for Adult Basic and Literacy Education

Montana's Distance Learning Policy for Adult Basic and Literacy Education Montana's Distance Learning Policy for Adult Basic and Literacy Education 2013-2014 1 Table of Contents I. Introduction Page 3 A. The Need B. Going to Scale II. Definitions and Requirements... Page 4-5

More information

What's My Value? Using "Manipulatives" and Writing to Explain Place Value. by Amanda Donovan, 2016 CTI Fellow David Cox Road Elementary School

What's My Value? Using Manipulatives and Writing to Explain Place Value. by Amanda Donovan, 2016 CTI Fellow David Cox Road Elementary School What's My Value? Using "Manipulatives" and Writing to Explain Place Value by Amanda Donovan, 2016 CTI Fellow David Cox Road Elementary School This curriculum unit is recommended for: Second and Third Grade

More information

Name: Class: Date: ID: A

Name: Class: Date: ID: A Name: Class: _ Date: _ Test Review Multiple Choice Identify the choice that best completes the statement or answers the question. 1. Members of a high school club sold hamburgers at a baseball game to

More information

First Grade Standards

First Grade Standards These are the standards for what is taught throughout the year in First Grade. It is the expectation that these skills will be reinforced after they have been taught. Mathematical Practice Standards Taught

More information

OCR for Arabic using SIFT Descriptors With Online Failure Prediction

OCR for Arabic using SIFT Descriptors With Online Failure Prediction OCR for Arabic using SIFT Descriptors With Online Failure Prediction Andrey Stolyarenko, Nachum Dershowitz The Blavatnik School of Computer Science Tel Aviv University Tel Aviv, Israel Email: stloyare@tau.ac.il,

More information

Statewide Framework Document for:

Statewide Framework Document for: Statewide Framework Document for: 270301 Standards may be added to this document prior to submission, but may not be removed from the framework to meet state credit equivalency requirements. Performance

More information

THE VIRTUAL WELDING REVOLUTION HAS ARRIVED... AND IT S ON THE MOVE!

THE VIRTUAL WELDING REVOLUTION HAS ARRIVED... AND IT S ON THE MOVE! THE VIRTUAL WELDING REVOLUTION HAS ARRIVED... AND IT S ON THE MOVE! VRTEX 2 The Lincoln Electric Company MANUFACTURING S WORKFORCE CHALLENGE Anyone who interfaces with the manufacturing sector knows this

More information

CHANCERY SMS 5.0 STUDENT SCHEDULING

CHANCERY SMS 5.0 STUDENT SCHEDULING CHANCERY SMS 5.0 STUDENT SCHEDULING PARTICIPANT WORKBOOK VERSION: 06/04 CSL - 12148 Student Scheduling Chancery SMS 5.0 : Student Scheduling... 1 Course Objectives... 1 Course Agenda... 1 Topic 1: Overview

More information

Math-U-See Correlation with the Common Core State Standards for Mathematical Content for Third Grade

Math-U-See Correlation with the Common Core State Standards for Mathematical Content for Third Grade Math-U-See Correlation with the Common Core State Standards for Mathematical Content for Third Grade The third grade standards primarily address multiplication and division, which are covered in Math-U-See

More information

Lesson M4. page 1 of 2

Lesson M4. page 1 of 2 Lesson M4 page 1 of 2 Miniature Gulf Coast Project Math TEKS Objectives 111.22 6b.1 (A) apply mathematics to problems arising in everyday life, society, and the workplace; 6b.1 (C) select tools, including

More information

Level 1 Mathematics and Statistics, 2015

Level 1 Mathematics and Statistics, 2015 91037 910370 1SUPERVISOR S Level 1 Mathematics and Statistics, 2015 91037 Demonstrate understanding of chance and data 9.30 a.m. Monday 9 November 2015 Credits: Four Achievement Achievement with Merit

More information

TCH_LRN 531 Frameworks for Research in Mathematics and Science Education (3 Credits)

TCH_LRN 531 Frameworks for Research in Mathematics and Science Education (3 Credits) Frameworks for Research in Mathematics and Science Education (3 Credits) Professor Office Hours Email Class Location Class Meeting Day * This is the preferred method of communication. Richard Lamb Wednesday

More information

Fundraising 101 Introduction to Autism Speaks. An Orientation for New Hires

Fundraising 101 Introduction to Autism Speaks. An Orientation for New Hires Fundraising 101 Introduction to Autism Speaks An Orientation for New Hires May 2013 Welcome to the Autism Speaks family! This guide is meant to be used as a tool to assist you in your career and not just

More information

Contents. Foreword... 5

Contents. Foreword... 5 Contents Foreword... 5 Chapter 1: Addition Within 0-10 Introduction... 6 Two Groups and a Total... 10 Learn Symbols + and =... 13 Addition Practice... 15 Which is More?... 17 Missing Items... 19 Sums with

More information

AP Calculus AB. Nevada Academic Standards that are assessable at the local level only.

AP Calculus AB. Nevada Academic Standards that are assessable at the local level only. Calculus AB Priority Keys Aligned with Nevada Standards MA I MI L S MA represents a Major content area. Any concept labeled MA is something of central importance to the entire class/curriculum; it is a

More information

SANTIAGO CANYON COLLEGE Reading & English Placement Testing Information

SANTIAGO CANYON COLLEGE Reading & English Placement Testing Information SANTIAGO CANYON COLLEGE Reaing & English Placement Testing Information DO YOUR BEST on the Reaing & English Placement Test The Reaing & English placement test is esigne to assess stuents skills in reaing

More information

Alignment of Australian Curriculum Year Levels to the Scope and Sequence of Math-U-See Program

Alignment of Australian Curriculum Year Levels to the Scope and Sequence of Math-U-See Program Alignment of s to the Scope and Sequence of Math-U-See Program This table provides guidance to educators when aligning levels/resources to the Australian Curriculum (AC). The Math-U-See levels do not address

More information

Answer each question by placing an X over the appropriate answer. Select only one answer for each question.

Answer each question by placing an X over the appropriate answer. Select only one answer for each question. Name: Date: Position Applied For: This test contains three short sections. The first section requires that you calculate the correct answer for a number of arithmetic problems. The second section requires

More information

Measuring physical factors in the environment

Measuring physical factors in the environment B2 3.1a Student practical sheet Measuring physical factors in the environment Do environmental conditions affect the distriution of plants? Aim To find out whether environmental conditions affect the distriution

More information

Characteristics of Functions

Characteristics of Functions Characteristics of Functions Unit: 01 Lesson: 01 Suggested Duration: 10 days Lesson Synopsis Students will collect and organize data using various representations. They will identify the characteristics

More information

Function Tables With The Magic Function Machine

Function Tables With The Magic Function Machine Brief Overview: Function Tables With The Magic Function Machine s will be able to complete a by applying a one operation rule, determine a rule based on the relationship between the input and output within

More information

Keystone Opportunity Zone

Keystone Opportunity Zone BEGINNING OF PART 2 OF 6 PARTS The Keystone Opportunity Zone, Zone created in 1999, 1999 became accessible to auto traffic with the completion of Keystone Boulevard in 2003. It is zoned for offices and

More information

Guide to the Uniform mark scale (UMS) Uniform marks in A-level and GCSE exams

Guide to the Uniform mark scale (UMS) Uniform marks in A-level and GCSE exams Guide to the Uniform mark scale (UMS) Uniform marks in A-level and GCSE exams This booklet explains why the Uniform mark scale (UMS) is necessary and how it works. It is intended for exams officers and

More information

Broward County Public Schools G rade 6 FSA Warm-Ups

Broward County Public Schools G rade 6 FSA Warm-Ups Day 1 1. A florist has 40 tulips, 32 roses, 60 daises, and 50 petunias. Draw a line from each comparison to match it to the correct ratio. A. tulips to roses B. daises to petunias C. roses to tulips D.

More information