a level maths

© All Rights Reserved

19 views

a level maths

© All Rights Reserved

- Aldrian Text Searching
- 06Jun-D1
- EEM2046 - 1011 T3 - Or Tutorial Questions
- Design and Analysis of Algorithms
- benchmark 1 study guide
- 9l8dh_098074001359705025
- CH041
- types of cryptarithms
- 70060191
- Taller PID Control ADRC
- Minimum Spanning Trees
- Empirically Evaluating the Use of Animations to Teach Algorithms_MDP
- Solution Problem 5
- wfwf
- Algoritmos de Ordenação
- Target Response Electrical usage Profile Clustering using Big Data
- Assignment of Cells to Switches Using Firefly Algorithm
- DS Pgm Using Cpp
- CS506_Week_3.pdf
- L_14_Divide&Conquer

You are on page 1of 11

January 2005

Advanced Subsidiary Examination

MATHEMATICS

Unit Decision 1

Tuesday 25 January 2005

MD01

Morning Session

an 8-page answer book;

the blue AQA booklet of formulae and statistical tables;

an insert for use in Questions 6 and 8 (enclosed).

You may use a graphics calculator.

*

*

*

Instructions

Use blue or black ink or ball-point pen. Pencil or coloured pencil should only be used for drawing.

Write the information required on the front of your answer book. The Examining Body for this paper

is AQA. The Paper Reference is MD01.

Answer all questions.

All necessary working should be shown; otherwise marks for method may be lost.

The final answer to questions requiring the use of tables or calculators should be given to three

significant figures, unless stated otherwise.

Fill in the boxes at the top of the insert.

*

*

*

*

*

Information

The maximum mark for this paper is 75.

Mark allocations are shown in brackets.

*

*

P76512/0105/MD01 6/6/6/6

MD01

LINE 10

INPUT A, B

LINE 20

LET C = A B

LINE 30

LET D = A + B

LINE 40

LET E = (D * D) (C * C)

LINE 50

LET F = E / 4

LINE 60

PRINT F

LINE 70

END

(4 marks)

(a) Use a bubble sort algorithm to rearrange the following numbers into ascending order,

showing the new arrangement after each pass.

19

20

15

(5 marks)

(b) Write down the number of comparisons and the number of swaps during the first pass.

(2 marks)

P76512/0105/MD01

The diagram shows the length, in miles, of the roads that have to be gritted.

B

8

A

10

G

4

8

E

Total length

= 87 miles

10

The gritter is based at A, and must travel along all the roads, at least once, before returning to A.

(a) Explain why it is not possible to start from A and, by travelling along each road only once,

return to A.

(1 mark)

(b) Find an optimal `Chinese postman' route around the network, starting and finishing at A.

State the length of your route.

(6 marks)

4 The Head Teacher of a school is allocating five teachers, Amy (A), Ben (B), Celia (C),

Duncan (D), and Erica (E), to the five posts of Head of Year 7, 8, 9, 10 and 11. The five teachers

are asked which year(s) they would be willing to take. This information is shown below.

Amy is willing to take Year 7 or Year 8.

Ben is willing to take Year 7, Year 8 or Year 10.

Celia is willing to take Year 8, Year 9 or Year 11.

Duncan will take only Year 9.

Erica will take only Year 11.

(a) Show this information on a bipartite graph.

(3 marks)

(b) Initially the Head Teacher assigns Amy to Year 8, Ben to Year 10, Celia to Year 9 and

Erica to Year 11.

Demonstrate, by using an alternating path from this initial matching, how each teacher can

be matched to a year that they are willing to take.

(4 marks)

P76512/0105/MD01

Turn over

5 The network shows the lengths, in miles, of roads connecting eleven villages.

E

13

16

12

18

I

19

20

32

14

10

16

15

11

(a) Use Prim's algorithm, starting from A, to find the minimum spanning tree for the network.

(4 marks)

(b) State the length of your minimum spanning tree.

(c) Draw your minimum spanning tree.

(1 mark)

(3 marks)

(d) A student used Kruskal's algorithm to find the same minimum spanning tree. Find the

seventh and eighth edges that the student added to his spanning tree.

(2 marks)

P76512/0105/MD01

A theme park is built on two levels. The levels are connected by a staircase. There are five

rides on each of the levels. The diagram shows the ten rides: A, B, ...... J. The numbers on the

edges represent the times, in minutes, taken to travel between pairs of rides.

Upper level

Lower level

H

5

1

6

3

1

(a) Use Dijkstra's algorithm on Figure 1 to find the minimum time to travel from A to J.

(6 marks)

(b) A new staircase is built connecting rides B and G. The time taken to travel from B to G

using this staircase is x minutes, where x is an integer. The time taken to travel from A to

G is reduced, but the time taken to travel from A to J is not reduced.

Find two inequalities for x and hence state the value of x.

(4 marks)

P76512/0105/MD01

Turn over

7 Rob delivers bread to six shops A, B, C, D, E and F. Each day, Rob starts at shop A, travels to

each of the other shops before returning to shop A. The table shows the distances, in miles,

between the shops.

(a)

12

10

14

13

10

16

10

14

15

12

13

16

15

11

10

11

(2 marks)

(ii) Find the length of the tour obtained by using the nearest neighbour algorithm starting

from A.

(4 marks)

(b) By deleting A, find a lower bound for the length of a minimum tour.

(5 marks)

(c) By deleting F, another lower bound of 45 miles is obtained for the length of a minimum

tour.

The length of a minimum tour is T miles. Write down the smallest interval for T which

can be obtained from your answers to parts (a) and (b), and the information given in this

part.

(3 marks)

P76512/0105/MD01

A bakery makes two types of pizza, large and medium.

Every day the bakery must make at least 40 of each type.

Every day the bakery must make at least 120 in total but not more than 400 pizzas in total.

Each large pizza takes 4 minutes to make, and each medium pizza takes 2 minutes to make.

There are four workers available, each for five hours a day, to make the pizzas.

The bakery makes a profit of 3 on each large pizza sold and 1 on each medium pizza sold.

Each day, the bakery makes and sells x large pizzas and y medium pizzas.

The bakery wishes to maximise its profit, P.

(a) Show that one of the constraints leads to the inequality

2x y 4 600

(b) Formulate this situation as a linear programming problem.

(1 mark)

(3 marks)

(c) On Figure 2, draw a suitable diagram to enable the problem to be solved graphically,

indicating the feasible region and an objective line.

(5 marks)

(d) Use your diagram to find the maximum daily profit.

(2 marks)

(e) The bakery introduces a new pricing structure in which the profit is 2 on each large pizza

sold and 2 on each medium pizza sold.

(i) Find the new maximum daily profit for the bakery.

(3 marks)

(ii) Write down the number of different combinations that would give the new maximum

daily profit.

(2 marks)

END OF QUESTIONS

P76512/0105/MD01

Surname

Other Names

Centre Number

Candidate Number

Candidate Signature

January 2005

Advanced Subsidiary Examination

MATHEMATICS

Unit Decision 1

MD01

Morning Session

Fill in the boxes at the top of this page.

Fasten this insert securely to your answer book.

P76512/0105/MD01 6/6/6/6

Turn over

Upper level

Lower level

H

5

1

6

3

1

5

P76512/0105/MD01

P76512/0105/MD01

0

0

100

200

300

400

500

600

200

300

400

100

c

x

P76512/0105/MD01

- Aldrian Text SearchingUploaded byMauliadi
- 06Jun-D1Uploaded byJonathan Foster
- EEM2046 - 1011 T3 - Or Tutorial QuestionsUploaded byNazmi Aziz
- Design and Analysis of AlgorithmsUploaded bySatyajit Mukherjee
- benchmark 1 study guideUploaded byapi-29921474
- 9l8dh_098074001359705025Uploaded byMabuti Ngwenya
- CH041Uploaded byIsaac Resendiz
- types of cryptarithmsUploaded byKushal raj
- 70060191Uploaded byWy Teay
- Taller PID Control ADRCUploaded byCARLOS EDUARDO HERNANDEZ MEDINA
- Minimum Spanning TreesUploaded byCharanjeev Singh
- Empirically Evaluating the Use of Animations to Teach Algorithms_MDPUploaded byPratik J Munjani (4/07/2012)
- Solution Problem 5Uploaded byDeVillersSeci
- wfwfUploaded byZiyvo
- Algoritmos de OrdenaçãoUploaded byJéll Pretta
- Target Response Electrical usage Profile Clustering using Big DataUploaded byAnonymous kw8Yrp0R5r
- Assignment of Cells to Switches Using Firefly AlgorithmUploaded byIAEME Publication
- DS Pgm Using CppUploaded byanand5703
- CS506_Week_3.pdfUploaded byShafaq Khan
- L_14_Divide&ConquerUploaded byapi-19981384
- 5 StabilityUploaded byAssassin47
- OPTIMUM PMU PLACEMENT TECHNIQUES - A COMPARATIVE STUDYUploaded bySatyendra Pratap Singh
- Chemical Process Engineering - PID AlgorithmsUploaded bypartho143
- CAD QUES.docxUploaded byrajasekarkpr
- Approximation AlgorithmsUploaded bynaman
- Which Tuning Method Should You UseUploaded byNorzaifee Nizamudin
- Tuning PID's - RC TutorUploaded byThomas Sjöling
- BFDF4ABC-452A-4467-8539-B9B15A3CC6ECUploaded byAhmadAliAKbarPhambra
- aco optiUploaded byShankaranarayanan Gopal
- Homework 4Uploaded byAle Gomez

- AQA testUploaded byVũ Lê
- Ostrich Egg Chick Buyers GuideUploaded byAhmed Nurul
- AIP for BridgesUploaded byAhmed Nurul
- AQA-MPC3-W-MS-JUN09Uploaded byRob Dunn
- 05Jun-M1Uploaded byAhmed Nurul
- 09Jun-C4-MSUploaded byAhmed Nurul
- 09Jan-C4-MSUploaded byAhmed Nurul
- 08Jun-C4-MSUploaded byAhmed Nurul
- 08Jan-C4-MSUploaded byAhmed Nurul
- 07Jun-C4-MSUploaded byAhmed Nurul
- AQA-MPC4-W-MS-JUN06Uploaded byVũ Lê
- AQA-MPC3-W-MS-JUN06Uploaded byfakeusername01
- 05Jun-C4-MSUploaded byAhmed Nurul
- 05Jun-C4Uploaded byAhmed Nurul
- 05Jun-D1Uploaded byAhmed Nurul
- 06Jan-C4Uploaded byAhmed Nurul
- AQA-MM1B-W-QP-JAN07Uploaded byÖzgür Oz Yilmaz Mehmet
- AQA-MM1B-W-QP-JAN06Uploaded byÖzgür Oz Yilmaz Mehmet
- 05Jan-M1Uploaded byAhmed Nurul
- M1Ch8 MomentumUploaded byAhmed Nurul
- M1Ch7 ProjectilesUploaded byAhmed Nurul
- M1Ch6_ConnectedParticlesUploaded byAhmed Nurul
- M1Ch4 Ch5 Forces NewtonUploaded byAhmed Nurul
- M1Ch3 VectorsUploaded byAhmed Nurul
- M1Ch3_RUVATUploaded byAhmed Nurul
- M1Ch2_SUVATUploaded byAhmed Nurul
- 12Jun-M2Uploaded byAhmed Nurul
- 12Jan-M2Uploaded byAhmed Nurul

- Mobilith SHC GreaseUploaded byalexander900616
- Y6/AS Physics final exam 11_12 Unit 1_answersUploaded byPaul Burgess
- AFAP-02(3)Uploaded byPAWANSVP
- Kem-rp Ing 18069Uploaded bymehdi
- 37Artificially Roughened Solar Air Heater a Comparative StudyUploaded bynidhul07
- 1-s2.0-S0169409X1530020X-mainUploaded bypavani
- Von Mises yield criteriaUploaded byParikshit Verma
- ME2401 Mechatronics QBUploaded bykarthiksubramanian94
- Chemours Freon R 22 MSDS (2)Uploaded byKhairul Muzamil
- 23. Language Games and Related AreasUploaded byOpa Yat
- Autocompactant Texas Reciclate 05.03.2011Uploaded byabout222
- Kinematics RobotUploaded byadrianwtx90
- AASlabmanual (1)Uploaded bylkomninos2221
- 03 Lecture Outline Part IUploaded byAbdullah Anwar
- Brown - Chemistry - The Central Science 11e (Pearson, 2008).pdfUploaded byStefano Ruberto
- Abdi-EVD2007-pretty.pdfUploaded byali
- 1-Chap Electric Charge and FieldUploaded bymanish kant nagar
- 50 short answer type question of Fluid Mechanics.docxUploaded byprashantyadav98
- 2.3.1 Ultrasound & Doppler EffectUploaded byAbrar Jahin
- Antenna QBUploaded byMurugesh Pandiyan
- 2005_Rd_1_Questions_tcm18-190744Uploaded byDeepMukherjee
- Introduction to Enhanced Oil RecoveryUploaded byThe PieonicBritz
- NIMCO CV300new_Uploaded byBruno Samaeian
- BVP621 LED1008CW 960W 220-240V NB GM.pdfUploaded byLauw Tjun Nji
- Activa s HoribaUploaded byJhon Violeta Moreyra
- CH3_resolvidoUploaded bylafabiano
- Chemsys Training Program IntroductionUploaded bynaam2105_996631495
- MFP-BRK-E65-IHKA-enUploaded byFemdin01
- Smart Closet 1Uploaded bysharath
- Cement Chapter 6Uploaded byshani5573