AS Maths Decision Paper January 2010 Model Answers.

Slides:



Advertisements
Similar presentations
Bubble Sort Example 9, 6, 2, 12, 11, 9, 3, 7 6, 9, 2, 12, 11, 9, 3, 7 Bubblesort compares the numbers in pairs from left to right exchanging.
Advertisements

Let’s repeat the ordinal numbers!
Minimum Spanning Tree Sarah Brubaker Tuesday 4/22/8.
Linear Programming Unit 2, Lesson 4 10/13.
 The factorial function (n!)  Permutations  Combinations.
Shortest Path Algorithm This is called “Dijkstra’s Algorithm” …pronounced “Dirk-stra”
Chapter 4 sections 1 and 2.  Fig. 1  Not connected  All vertices are even.  Fig. 2  Connected  All vertices are even.
3.4 Linear Programming p Optimization - Finding the minimum or maximum value of some quantity. Linear programming is a form of optimization where.
Are You Smarter Than a 5 th Grader? 1,000,000 5th Grade 5th Grade Equations 5th Grade 5th Grade Equations 5th Grade 5th Grade Equations 4th Grade 4th.
D Nagesh Kumar, IIScOptimization Methods: M3L2 1 Linear Programming Graphical method.
To know and use the Bubble Sort and Shuttle Sort Algorithms.
3.6 Solving Absolute Value Equations and Inequalities
Bubble Sort Example
3.3 Graphing and Solving Systems of Linear Inequalities p. 156.
Essential Question: How do you solve a system of inequalities by graphing?
Class Opener: Solve each equation for Y: 1.3x + y = y = 2x 3.x + 2y = 5 4. x – y = x + 3y = x – 5y = -3.
Constraints Feasible region Bounded/ unbound Vertices
Stoichiometry Project Pd5 3/18/10. Problem If 4.1 grams of Cr is heated with 9.3 grams of Cl 2, what mass of CrCl 3 will be produced? next.
7.5 Solving Systems of Inequalities by Graphing Steps Intersecting Regions Separate Regions.
By Meli & Amy & Meggie & Bex. What is route inspection hmmmm??? Objective: Is to go along every single edge and end up back to where you started from.
In the first pass, the first two numbers are compared. The shuttle sort compares the numbers in pairs from left to right exchanging when necessary.
3.3 Linear Programming. Vocabulary Constraints: linear inequalities; boundary lines Objective Function: Equation in standard form used to determine the.
Solve One Step Inequalities. ˂ ˃ Comparison Symbols ˃ ˂ Less Than Greater Than Less Than or equal to Greater Than or equal to - and how to graph x Open.
EXAMPLE 1 Graph a function of the form y = | x – h | + k Graph y = | x + 4 | – 2. Compare the graph with the graph of y = | x |. SOLUTION STEP 1 Identify.
Linear Programming Model Answers. Jan 2008 Type A 2x + 4y + 3z≤ 360 Type B 3x + 2y + 4z≤ 270 Type C x + 3y + 5z≤ 450 Altogether 6x + 9y + 12z≥ 720 (the.
3.4 Linear Programming p Optimization - Finding the minimum or maximum value of some quantity. Linear programming is a form of optimization where.
AS Decision Maths Tips for each Topic. Kruskal and Prim What examiner’s are looking for A table of values in the order that they are added and the total.
AS Maths Decision Paper January 2011 Model Answers.
Linear Programming Chapter 3 Lesson 4 Vocabulary Constraints- Conditions given to variables, often expressed as linear inequalities. Feasible Region-
The graph is neither Eulerian or Semi – Eulerian as it has 4 ODD vertices.
October 7: Systems of Equations Today you will review how to solve systems of equations by graphing and will learn how to classify the systems. - HW Review.
Box and Whisker Plots and the 5 number summary
AS Maths Decision Paper June 2011 Model Answers.
AS Maths Decision Paper June 2011 Model Answers.
Consecutive Integer Problems
Jan 2007.
Combinations COURSE 3 LESSON 11-3
Shuttle Sort Example 1st pass Comparisons: 1
3.2 Linear Programming 3 Credits AS
3-3 Optimization with Linear Programming
Linear Programming.
1-6 Midpoint Find the midpoint of: DE: DC: AB: AE: (2+5) / 2 = 3.5
AS Maths Decision Paper January 2006 Model Answers.
8.4 Linear Programming p
6.5 Solving Inequalities by Factoring
Graphing Systems of Linear Inequalities
Floyd’s Algorithm (shortest-path problem)
Splash Screen.
AS Maths Decision Paper January 2012 Model Answers.
Bubble Sort Example 9, 6, 2, 12, 11, 9, 3, 7 6, 9, 2, 12, 11, 9, 3, 7 Bubblesort compares the numbers in pairs from left to right exchanging.
AB AC AD AE AF 5 ways If you used AB, then, there would be 4 remaining ODD vertices (C, D, E and F) CD CE CF 3 ways If you used CD, then, there.
Lesson 7-5 Graphing Systems of Inequalities
Humanities Matching Final
Splash Screen.
Decision Maths Unit 7 Sorting Algorithms 3. Shell Sort.
Humanities Matching Final
Splash Screen.
LINEARPROGRAMMING 4/26/2019 9:23 AM 4/26/2019 9:23 AM 1.
Warm Up Find the value of m undefined.
AS Maths Decision Paper June 2013 Model Answers.
Section Linear Programming
7-6 Inequalities.
1.6 Linear Programming Pg. 30.
Shuttle Sort Example 1st pass Comparisons: 1
may Test 3 Review Test 3 Test 3 Activity
Chapter 2 Section 7 Two-Variable Inequalities
Thursday, March 14, 2019 HW: TB348 #1-19 odd (NOT online)
Homework Solutions.
AP Physics Chapter 2 Answers
Jan 2009.
Presentation transcript:

AS Maths Decision Paper January 2010 Model Answers

It is important students have a copy of the questions as you go through the model answers.

1a)

A M B N C P D R E S F V

D – R – B – N – C – V F – R – D – S – E – P – A – M A M B N C P D R INITIAL MATCH A M B N C P D R E S F V D – R – B / – N – C / – V F – R – D / – S – E / – P – A / – M FINAL MATCH AM, BN, CV, DS, EP, FR

Initial List 13 16 10 11 4 12 6 7 1c 0s 1c 1s 1c 1s 1c 1s 1c 1s 1c 1s 1c 1s After First Pass 13 10 11 4 12 6 7 16 1c 1s 1c 1s 1c 1s 1c 1s 1c 1s 1c 1s After Second Pass 10 11 4 12 6 7 13 16 1c 0s 1c 1s 1c 0s 1c 1s 1c 1s After Third Pass 10 4 11 6 7 12 13 16 After Fourth Pass 4 10 6 7 11 12 13 16 After Fifth Pass 4 6 7 10 11 12 13 16 After Sixth Pass 4 6 7 10 11 12 13 16 Comparisons Swaps 1st Pass 2nd Pass 3rd Pass 7 6 6 6 5 3

x ≥ 0, y ≥ 0 Write the inequalities as equations x + 4y ≤ 36 4x + y ≤ 68 Plot these on the graph and shade the UNWANTED region y ≤ 2x y ≥ ¼x

4x + y = 68 x + 4y = 36 y = 2x FEASIBLE REGION y = ¼x

Maximum value for P = x + 5y is

AC = 13 AE = 14 EI = 15 CD = 16 CH = 20 EF = 21 FB = 19 BG = 19 Total Spanning tree = 137

G B C A F H E D I

ODD vertices at B, C, D, E BC + DE BC (22) + DE (18) = 40 BD + CE BD (38) + CE (27) = 65 BE + CD BE (22) + CD (16) = 38 Repeat BE + CD = 38 Total route is 307m + (BE + CD) 38 = 345 metres

B E C D A B 3.7 + 1.9 + 2.7 + 2.0 + 1.7 = 12.0 or 12 B D A C E B 1.8 + 2.0 + 1.9 + 4.2 + 3.6 = 13.5

The best upper bound is the lowest value, so 12.0 From To The best upper bound is the lowest value, so 12.0 B A D E C B 1.7 + 2.0 + 1.7 + 4.2 + 2.5 = 12.1

Line 10 A B N T D H E 1 5 2 Line 20 Line 30 1 Line 40 2 Line 50 1 Line 60 126 Line 70 3 Line 90 180 Line 70 5 Line 110 Print Area (T x E) = 180

Line 10 A B N T D H E 1 5 4 Line 20 Line 30 1 Line 40 1 Line 50 0.5 Line 60 126 Line 70 2 Line 90 142 Line 70 3 Line 90 196 Line 70 4 Line 90 324 Line 70 5 Line 110 Print Area (T x E) = 162

25 24 5 15 27 38 + x + y 10 9 20 18 + x + y 50 8 19 28 + 3x + y 18 As all three routes are the same weight then 16 3x + y = 22 6 28 x + y = 12 2x = 10 28 + 3x + y = 50, so 3x + y = 22 x = 5 5 + y = 12 y = 7 and 38 + x + y = 50, so x + y = 12 26 25 So x = 5 and y = 7

Type A 2x + 3y + 4z ≤ 360 Type B 3x + y + 5z ≤ 300 Type C 4x + 3y + 2z ≤ 400 Type A > Type B 2x + 3y + 4z > 3x + y + 5z You must leave at least ONE value on the left, as y would be the only value to leave a positive value, bring the y’s over from the right and the x and z’s to the left. 2y > x + z

5x + 4y + 9z ≥ 4x + 3y + 2z So x + y + 7z ≥ 0 4x + 3y + 2z ≥ 0.4 (9x + 7y + 11z) 20x + 15y + 10z ≥ 2 (9x + 7y + 11z) 20x + 15y + 10z ≥ 18x + 14y + 22z You must leave at least ONE value on the left, as x and y would leave positive values bring the x and y’s over from the right 2x + y ≥ 12z