0 Up votes0 Down votes

13 views10 pagesThe copyright does not belong to me. Just for share

Jan 20, 2013

© Attribution Non-Commercial (BY-NC)

PDF, TXT or read online from Scribd

The copyright does not belong to me. Just for share

Attribution Non-Commercial (BY-NC)

13 views

The copyright does not belong to me. Just for share

Attribution Non-Commercial (BY-NC)

- Steve Jobs
- The Woman Who Smashed Codes: A True Story of Love, Spies, and the Unlikely Heroine who Outwitted America's Enemies
- NIV, Holy Bible, eBook
- NIV, Holy Bible, eBook, Red Letter Edition
- Cryptonomicon
- Hidden Figures Young Readers' Edition
- Everybody Lies: Big Data, New Data, and What the Internet Can Tell Us About Who We Really Are
- Make Your Mind Up: My Guide to Finding Your Own Style, Life, and Motavation!
- Console Wars: Sega, Nintendo, and the Battle that Defined a Generation
- The Golden Notebook: A Novel
- Alibaba: The House That Jack Ma Built
- Life After Google: The Fall of Big Data and the Rise of the Blockchain Economy
- Hit Refresh: The Quest to Rediscover Microsoft's Soul and Imagine a Better Future for Everyone
- Hit Refresh: The Quest to Rediscover Microsoft's Soul and Imagine a Better Future for Everyone
- The Innovators: How a Group of Hackers, Geniuses, and Geeks Created the Digital Revolution
- The 10X Rule: The Only Difference Between Success and Failure
- Autonomous: A Novel

You are on page 1of 10

Wednesday 18 January 2006 1.30 pm to 3.00 pm

MD01

For this paper you must have: * an 8-page answer book * the blue AQA booklet of formulae and statistical tables * an insert for use in Question 5 (enclosed) You may use a graphics calculator.

Time allowed: 1 hour 30 minutes 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 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. The marks for questions are shown in brackets.

* *

P80606/Jan06/MD01 6/6/6/

MD01

(2 marks)

(b) Given that initially A is matched to W , B is matched to X , C is matched to V , and E is matched to Y , use the alternating path algorithm, from this initial matching, to find a complete matching. List your complete matching. (5 marks)

2 Use the quicksort algorithm to rearrange the following numbers into ascending order. Indicate clearly the pivots that you use. 18 23 12 7 26 19 16 24 (5 marks)

P80606/Jan06/MD01

(a)

(i) State the number of edges in a minimum spanning tree of a network with 10 vertices. (1 mark) (ii) State the number of edges in a minimum spanning tree of a network with n vertices. (1 mark)

(b) The following network has 10 vertices: A, B, . . ., J . The numbers on each edge represent the distances, in miles, between pairs of vertices.

6 8

B 17

18

13 20 F

14

E 9

15

19 16 H 12

7 5

11

10

J (i) Use Kruskal's algorithm to find the minimum spanning tree for the network. (5 marks) (ii) State the length of your spanning tree. (iii) Draw your spanning tree. (1 mark) (2 marks)

Turn over

P80606/Jan06/MD01

4 The diagram shows the feasible region of a linear programming problem. y 120

100

80

60

40

feasible region

20

20

40

60

80

100

120

(a) On the feasible region, find: (i) the maximum value of 2x 3y ; (ii) the maximum value of 3x 2y ; (iii) the minimum value of 2x y. (b) Find the 5 inequalities that define the feasible region. (2 marks) (2 marks) (2 marks) (6 marks)

P80606/Jan06/MD01

5 [Figure 1, printed on the insert, is provided for use in this question.] The network shows the times, in minutes, to travel between 10 towns.

B 14 A 8 C 5

13

14

14

12

18

13

(a) Use Dijkstra's algorithm on Figure 1 to find the minimum time to travel from A to J . (6 marks) (b) State the corresponding route. (1 mark)

6 Two algorithms are shown. Algorithm 1 Line Line Line Line Line Line Line Line 10 20 30 40 50 60 70 80 Input P Input R Input T Let I P R T=100 Let A P I Let M A=12 T Print M Stop Algorithm 2 Line Line Line Line Line Line Line Line Line Line Line Line 10 20 30 40 50 60 70 80 90 100 110 120 Input P Input R Input T Let A P K0 Let K K 1 Let I A R=100 Let A A I If K < T then goto Line 60 Let M A=12 T Print M Stop

In the case where the input values are P 400, R 5 and T 3: (a) trace Algorithm 1; (b) trace Algorithm 2. (3 marks) (4 marks)

Turn over

P80606/Jan06/MD01

7 Stella is visiting Tijuana on a day trip. The diagram shows the lengths, in metres, of the roads near the bus station.

150

B 100 120

200

250

200

100

80 160

150 160

40

I Total 2090

80

Stella leaves the bus station at A. She decides to walk along all of the roads at least once before returning to A. (a) Explain why it is not possible to start from A, travel along each road only once and return to A. (1 mark) (b) Find the length of an optimal `Chinese postman' route around the network, starting and finishing at A. (5 marks) (c) At each of the 9 places B, C, . . ., J , there is a statue. Find the number of times that Stella will pass a statue if she follows her optimal route. (2 marks)

P80606/Jan06/MD01

8 Salvadore is visiting six famous places in Barcelona: La Pedrera L, Nou Camp N , Olympic Village O, Park Guell P, Ramblas R and Sagrada Familia S. Owing to the traffic system the time taken to travel between two places may vary according to the direction of travel. The table shows the times, in minutes, that it will take to travel between the six places. To From La Pedrera L Nou Camp N Olympic Village O Park Guell P Ramblas R Sagrada Familia S La Pedrera L 25 15 30 20 25 Nou Camp N 35 40 35 30 35 Olympic Village O 30 20 25 17 29 Park Guell P 30 21 25 25 20 Ramblas R 37 25 30 35 30 Sagrada Familia S 35 40 29 20 25

(a) Find the total travelling time for: (i) the route LNOL; (ii) the route LONL. (b) Give an example of a Hamiltonian cycle in the context of the above situation. (1 mark) (1 mark) (1 mark)

(c) Salvadore intends to travel from one place to another until he has visited all of the places before returning to his starting place. (i) Show that, using the nearest neighbour algorithm starting from Sagrada Familia S, the total travelling time for Salvadore is 145 minutes. (3 marks) (ii) Explain why your answer to part (c)(i) is an upper bound for the minimum travelling time for Salvadore. (2 marks) (iii) Salvadore starts from Sagrada Familia S and then visits Ramblas R. Given that he visits Nou Camp N before Park Guell P, find an improved upper bound for the total travelling time for Salvadore. (3 marks)

Turn over

P80606/Jan06/MD01

9 A factory makes three different types of widget: plain, bland and ordinary. Each widget is made using three different machines: A, B and C. Each plain widget needs 5 minutes on machine A, 12 minutes on machine B and 24 minutes on machine C. Each bland widget needs 4 minutes on machine A, 8 minutes on machine B and 12 minutes on machine C. Each ordinary widget needs 3 minutes on machine A, 10 minutes on machine B and 18 minutes on machine C. Machine A is available for 3 hours a day, machine B for 4 hours a day and machine C for 9 hours a day. The factory must make: more plain widgets than bland widgets; more bland widgets than ordinary widgets. At least 40% of the total production must be plain widgets. Each day, the factory makes x plain, y bland and z ordinary widgets. Formulate the above situation as 6 inequalities, in addition to x 5 0, y 5 0 and z 5 0, writing your answers with simplified integer coefficients. (8 marks)

END OF QUESTIONS

Copyright 2006 AQA and its licensors. All rights reserved. P80606/Jan06/MD01

MD01

Insert

Wednesday 18 January 2006 Insert for use in Question 5. Fill in the boxes at the top of this page. Fasten this insert securely to your answer book. 1.30 pm to 3.00 pm

Turn over

P80606/Jan06/MD01 6/6/6/

14

13

12

14

14

Copyright 2006 AQA and its licensors. All rights reserved. P80606/Jan06/MD01

18

13

- C04 ImagesUploaded byJavierFelixReynosoPacheco
- A Constructive Approach to Solving 3D Geometric Constraint Systems Using Dependence AnalysisUploaded byStruct DesignPro
- Algoritmos de OrdenaçãoUploaded byJéll Pretta
- matrixfactorizationUploaded byHùng Quách
- moni.txtUploaded bySwetha
- DeadlocksUploaded bySaumya Bhardwaj
- hw2Uploaded bykalaputra
- Lab 4 Best First Heuristic SearchUploaded bychakravarthyashok
- Big-O AlgorithmUploaded bySumon Dhara
- Csc4320 Chapter 9-2Uploaded bySridhar Panneer
- hihhiUploaded byNick
- ConstrainedAssignmentUploaded byKrishna Bayini
- 34No3-01Uploaded byعبدالله عمر
- AppendixUploaded byHaris Fadilah E-Mang Top
- COMP621U Presentation WanPengfeiUploaded byAbhishek Gupta
- Assignment 1 (074MSTrE010)Uploaded bySunari Magar Rakesh
- Neuro & Fuzzy System Practical ImagesUploaded byPradeep Karmakar
- Graphs.pdfUploaded bySohaib
- Analysis & Design of Algorithm Jan 2010Uploaded byPrasad C M
- BFS DFSUploaded bymadhurimapatra1987
- Inflexional Pt ProblemUploaded byapi-25887708
- i2ml3e-chap9.pptxUploaded byvarun3dec1
- www99Uploaded bypostscript
- Example on CPAUploaded byChristsang2010
- Hoare Logic 1Uploaded bypetrouu
- Lecture 5dbUploaded bymohsin dish
- Fundamentals of Hidden Markov Model1Uploaded byNarasimhan Kumaravelu
- vlsi dspUploaded bySridhar Nandipati
- Daa Supply 2019Uploaded bycholleti prathyuusha
- Bankers AlgorithmUploaded byRahul Tiwari

- NTU sample physicsUploaded byVũ Lê
- Eju 2010 01question Science EnUploaded byhanif yuandi
- math312-handout1Uploaded byPrashant Chaudhary
- Tutorial 1Uploaded byVũ Lê
- NUS sampleUploaded byVũ Lê
- AQA testUploaded byVũ Lê
- De Thi Thu DH Tieng Anh Thang 32014 KeysUploaded byVũ Lê
- AQA-MPC4-W-MS-JUN06Uploaded byVũ Lê
- NTU Physics Syllabus 2012Uploaded byVũ Lê
- AQA-MM03-W-MS-JUN06Uploaded byVũ Lê
- AQA-MPC3-W-QP-JUN06Uploaded byfakeusername01
- AQA-MPC1-W-QP-JUN06Uploaded byVũ Lê
- AQA-MM1A-W-MS-JUN06Uploaded byVũ Lê
- AQA-MFP2-W-QP-JUN06Uploaded byVũ Lê
- AQA-MPC1-W-MS-JUN06Uploaded byVũ Lê
- AQA-MM03-W-QP-JUN06Uploaded byVũ Lê
- AQA TestUploaded byVũ Lê
- AQA TestUploaded byVũ Lê
- AQA-MM2A-W-QP-JUN06Uploaded byVũ Lê
- AQA-MM2A-W-MS-JUN06Uploaded byVũ Lê
- AQA TESTUploaded byVũ Lê
- Test 001Uploaded byVũ Lê
- AQA-MM1B-W-QP-JUN06Uploaded byÖzgür Oz Yilmaz Mehmet
- AQA-MM1B-W-MS-JUN06Uploaded byVũ Lê
- AQA-MFP4-W-QP-JUN06Uploaded byVũ Lê
- AQA-MFP4-W-MS-JUN06Uploaded byVũ Lê
- AQA-MFP3-W-QP-JUN06Uploaded byVũ Lê
- AQA-MFP3-W-MS-JUN06Uploaded byVũ Lê

- 4 educ 115 detailed lesson planUploaded byapi-267898429
- Image Enhancement Techniques using Highpass and Lowpass FiltersUploaded bySumit Kushwaha
- Cluster AnalysisUploaded bybestnifty
- topost_phaseplanehandoutUploaded bysasi_manjaz
- Simulation and Stochastic ModelsUploaded bytirumalayasaswini
- Atmel 8951 CryptoAuth RSA ECC Comparison Embedded Systems WhitePaperUploaded byRoberto Roberth
- MYSTRAN Demo Problem ManualUploaded byja_mufc_scribd
- Intro_sectionA.pdfUploaded byjonthemes
- Jobshop Scheduling in a Shipyard (Paper)Uploaded bypal_malay
- Nodal Pricing Exercise - SolutionUploaded byFemi Obisesan
- TERATOM -- Chapter 3 Hashing of the Primary IndexUploaded byAnand Ranjan
- chap5&6. hwUploaded byJesse Isaac McCall
- Filter Design ReportUploaded byDhruv Varshney
- Assignment 1Uploaded bydivyanshuvarma
- On the Maximum Degree Chromatic Number of a GraphUploaded byVy'n Iipsychz Athrylith
- Image Content Description Using LSTM ApproachUploaded byCS & IT
- SimulationPerformance_15.2_en_r1596.pdfUploaded byJennifer Charles
- HelpUploaded byredouan karihi
- High Speed RSA ImplementationsUploaded byrodrigofran
- Uysal, Gunal - 2012 - A Novel Probabilistic Feature Selection Method for Text ClassificationUploaded byKaspujek Pujek
- Inference for the Least-Squares LineUploaded byldlewis
- lecture1aUploaded bypounding
- Summary Artificial Intelligence 1 - RuGUploaded byRamon Meffert
- trade off analysis.pdfUploaded byYsma Yee
- Intro to NN & FLUploaded byZerocode Code
- EncrytionUploaded bysrisairampoly
- TocUploaded byAkhil Gupta
- Final Exam Classical MechanicsUploaded byAmbreen Khan
- ESTIMATION OF THE SURVIVAL FUNCTION UNDER THE CONSTANT SHAPE BI-WEIBULL FAILURE TIME DISTRIBUTION BASED ON THREE LOSS FUNCTIONSUploaded byIJAR Journal
- CDC Complexity UnlockedUploaded byVasile Trifu

## Much more than documents.

Discover everything Scribd has to offer, including books and audiobooks from major publishers.

Cancel anytime.