MT sched AE aE DEEL eat, ca PEARSON EDEXCEL INTERNATIONAL A LEVEL Maes UT ee Sy ha LT) ¢ eerPDF COMPILED BY SAAD PEARSON EDEXCEL INTERNATIONAL A LEVEL DECISION MATHEMATICS 1 Student Booksisted by Persen Edaton Limited, 0 Stand, London WEA ORL. wpoamonglbaichostacere copes of ocel spaifeation a Parson qualifisston ry be foune on the \webote Hipa/;quaifeaiora paren com “oe © PoarsonEaueston Utes 2018 ted 2 Linea Bice and Ee Pract “ypost by Toch-St Ld, Gateshead UC Oriol tstatons © Pesrecn Eoveaton Lea 2018 strats ty © Tech Set Gates UR (Cover design by © Person Ecucaten Lites ‘ho rights ot Marin Crozer, Susie Jameson, Kh Plager, Peter tran, oe Sahowsid and Hany Sth tobe Keatfod a the autor lis wok hove ‘boon asserted thr accardonce with te Copigh, Dears and Parts et 1908 Fret pulohed 2018 21201018 sose7esaaz1 ‘ah Liber Catslogirg in Putco a ‘estalogve recor os cok i aveiableern h tin trary sonore 1 2aze46 363 copyri notce ‘Aleghis eserve. No part of bie may be ereduced inary form ob ary eur (tect potecopring 0: toring hi ery mem by lecrnic ere ond ‘wheter not varetonty or Heidel fo ere otha vn et thispubleaton) without he waiten permission of he coprigh ane, except in acoréance with the pevisenaol ha Copyright, Daigne an Paton At 1088 or una he torre ft aloonco sev bythe Copyr@h Looneing Mgerey, Bama fn 86 Fat ano, Landon, EC#A EN ua couh} Applsatons for to copyright owners lite persion should eevee 1 he publish Prrtein Sovak by Neograt Ploure Crects| “Tro aulners ana publisher would set thanks lowing nad and uerisatons lor bernisson vo epedace phebaapts: ‘Alam: ZUMA Press, ran Wasioton 29. ary Popor 52, Roy LANGSTAE 405 Nataliya Hora 192, ws falar 170, Gaty Images: Stock Unrseaeed 32; ‘Science Photo brary Pe Mercl 69 ‘Cove imogo: Font tty Imogos: Pete Ayan Inside ont cover Shatteratochcom: Drity Lobanov ‘lotr images © Pearson Eassaten Lites 2018 ‘llarwork Pearson EcceatonLoitd 2018 Endorsement Stoternent serder to sure thal his resource fers tigh-uaiy support forte associated Pearson qualfetn, thas been tough areview poco by tho enerdig body “Ths procss corms that thie roaurs fly covers the teaching and eamng cortnt of tho epostizaton or part of aepoctiation al wach ts ame leo orfrme tha to nonselos an appropiate oaancebuthoon the deveopmex ‘teabjea! il, Knowledge se undrtaning, in Stn to preperton or Encersemart doe no cous ary ucance on asessmon! atte oF process {@0_pracice questions or advea.n howto arsner assessment cuesirs) "cada nthe eso» nor Obes resrne any particular aoc he teaching 9 delvery f areas course, ‘ile ne pubisers nave made every attempt to ensure that adic on te {ualiceten adits assessments accurate the cli pectecin and ‘Ssovhted eiessrenegutlarce matols ae te ony athe source ‘rirmaten and shout always be refers ferdfintve guidance Pearson exarinrs hav nt continued to any sections mn teracouce rlovant to ‘warrnaten pap for which ey have roponsbily. Eeriner wil ot ue ndorsed enue abs eour of eter for any sssoscmert sat by Pearson. Endorsement ef arosouree does ret aan that he foaourea rogues aniave tne Pesach uaieatin, he does ran tht 'Sthe of surate mata aval © suppod he quaeaton and any rescurce produce b) the aang Dod Shalisclude is and che operateCELE COURSE STRUCTURE ABOUT THIS BOOK vi QUALIFICATION AND ASSESSMENT OVERVIEW viii EXTRA ONLINE CONTENT x 1 ALGORITHMS 1 2 GRAPHS AND NETWORKS 29 3 ALGORITHMS ON GRAPHS 49 REVIEW EXERCISE 1 76 4 ROUTE INSPECTION 81 5 THE TRAVELLING SALESMAN PROBLEM 95 6 CRITICAL PATH ANALYSIS 121 7 LINEAR PROGRAMMING 154 REVIEW EXERCISE 2 187 EXAM PRACTICE 199 GLOSSARY 205 ANSWERS 208 INDEX 255sss CHAPTER 1 ALGORITHMS 1 CHAPTER 4 ROUTE 1.1 USING AND UNDERSTANDING INSPECTION 81 ALGORITHMS 2 4.1 EULERIAN GRAPHS 82 4.2 FLOW CHARTS 5 4.2 USING THE ROUTE INSPECTION 1.3 BUBBLE SORT 10 ALGORITHM 85 1.4 QUICK SORT 13 CHAPTER REVIEW 4 1 1.5 BIN-PACKING ALGORITHMS 16 Soe s, CHAPTER 5 THE TRAVELLING SALESMAN PROBLEM 95 5.1 THE CLASSICAL AND PRACTICAL CHAPTER 2 GRAPHS AND TRAVELLING SALESMAN NETWORKS 29 PROBLEMS 96 2.1 MODELLING WITH GRAPHS 30 5.2USING A MINIMUM SPANNING 2.2 GRAPH THEORY 34 TREE METHOD TO FIND AN 2.3 SPECIAL TYPES OF GRAPH 38 UPPER BOUND 100 2.4 REPRESENTING GRAPHS AND 5.3 USING A MINIMUM SPANNING NETWORKS USING MATRICES 42 TREE METHOD TO FIND A CHAPTER REVIEW 2 4 LOWER BOUND 107 5.4 USING THE NEAREST NEIGHBOUR CHAPTER 3 ALGORITHMS ON ALGORITHM TO FIND AN UPPER GRAPHS 49 BOUND mM 3.1 KRUSKAL'S ALGORITHM, so; UARTER REVIEWS ne 3.2 PRIM'S ALGORITHM 54 3.3 APPLYING PRIM’S ALGORITHM TO A DISTANCE MATRIX 57 3.4 THE NEAREST NEIGHBOUR ALGORITHM 60 3.5 USING DIJKSTRA'S ALGORITHM TO FIND THE SHORTEST PATH 64 CHAPTER REVIEW 3 1 REVIEW EXERCISE 1 76TSG CHAPTER 6 CRITICAL PATH REVIEW EXERCISE 2 187 ANALYSIS 121 6.1 MODELLING A PROJECT 122 EXAM PRACTICE 199 6.2 DUMMY ACTIVITIES 126 6.3 EARLY AND LATE EVENT TIMES 131 64 THEFLOATOFANAcTITY —-133- GLOSSARY 205 6.5 CRITICAL ACTIVITIES 136 6.6 GANTT CHARTS 139 ANSWERS 208 6.7 SCHEDULING DIAGRAMS 143 a EVIEW 6 HAPTER REVIEW 6 148 INDEX 255 CHAPTER 7 LINEAR PROGRAMMING 154 7.1 LINEAR PROGRAMMING. PROBLEMS 155 7.2 GRAPHICAL METHODS 161 7.3 LOCATING THE OPTIMAL POINT — 165 7.4 SOLUTIONS WITH INTEGER VALUES 178 CHAPTER REVIEW 7 183ABOUT THIS BOOK ‘The following three themes have been fully integrated throughout the Pearson Edexcel International ‘Advanced Level in Mathematics series, so they can be applied alongside your learning. 1. Mathematical argument, language and proof, + Rigorous and consistent approach throughout ‘+ Notation boxes explain key mathematical language and symbols 2. Mathematical problem-solving ‘The Mathematical Problem Solving Cycle + Hundreds of problem-solving questions, fully integrated speaiy he pratiem = into the main exercises + Problem-solving boxes provide tips and strategies inert eeats Kane + Challenge questions provide extra stretch LL _processana 3. Transferable skills present information + Transferable skills are embedded throughout this book. in the exercises and in some examples ‘+ These skills are signposted to show students which skills they are using and developing Finding your way around the book ACO its) Each chapter ie mapped tothe specification cortont fr oa Each chapter starts with alist of Leaning otfectve} The Por knowledge check helps meke sure You are ready to start the chepter “The real wort applications cf the rmatnernates you are about Tarn aro nighighted a the start otth Glossary terms wit be ered by bold appearance,AGS imap nae signposted where they raturaly occur inthe exereges and amples ‘Ghatenge boxes ave you achancoto tackle ome more aiteut ‘questions ‘Siec-by-step worked ‘examotes focus onthe key ypes cf questions you" need to tack Baenanhyoom pai the an cate, ano Watch ot BawlaWie Guettiond|) boxes mig sas unore suceres se ageed ain @®, wen eooransint sane Problem-solving wih examesive ———— Soke SS | Sees Alter every fon chapters, a Review enercise ees yeu sonsolicate your learing with lots of cam aye quoctone Review exercise [tll pracice pape al the back of the bookchelps you prepare for he real tingOTe Ut EUs sss Mess ad QUALIFICATION AND ASSESSMENT OVERVIEW Qualification and content overview Decision Mathematics 1 (D1) is an optional unit in the following qualifications: International Advanced Subsidiary in Mathematics International Advanced Subsidiary in Further Mathematics International Advanced Level in Mathematics International Advanced Level in Further Mathematics Assessment overview ‘The following table gives an overview of the assessment for this unit. We recommend that you study this information closely to help ensure that you are fully prepared for this course and know exactly what to expect in the assessment. [mark [Time [avaitabiiy DisDedsion Mathematics |33}%0fAS [75 | MoUr30 mine_| January and june Paper code WOM11/01 152 Sof WAL First assessment June 2019 1s: International Advanced Subsidiary, IAL: International Advanced A Level. Assessment objectives and weightings oer Recall select and use their knowledge of mathematical Facts, concepts and techniques ina variety of contents, Construct rigorous mathematical arguments and proofs through use of precise statements, logical deduction and inference and by the manipulation of mathematical expressions, including the construction of extended arguments for handling substantial problems presented in unstructured form. Recall select and use their knowledge of standard mathematical models to represent ‘k03_| situations in the real world; recognise and understand given representations involv stonderd models; present end interpret results from such models in terms ofthe oviginel situation, including discussion of the assumptions made and refinement of such models. CComprehend transiations of common realistic contexts into mathematics; use the results of ‘AO’ | calculations to make predictions, or comment on the context; and, where appropriate, read 53% aitcaly and comprehend longer mathematical arguments or examples of applications. Use contemporary calculator technlogy and other permitted resources (such as formulae ‘A085. | booklets or statistical tables) accurately and efficiently; understand when not to use such 5% technology, and its limitations. Give answers to appropriate accuracy. 30% 30% 10%CT BO ss sss Nad ix Relationship of assessment objectives to units Maths cutof 75 20-25 20-25 15-20 5-10 5-10 [a 25335 265-335 20-268 aay a Calculators Students may use a calculator in assessments for these qualifications. Centres are responsible for making sure that calculators used by their stuclents meet the requirements given in the table below. Students are expected to have available a calculator with at least the following keys: +,-. x, 3,7, %% 1, In x, e% xf sine, cosine and tangent and their inverses in degrees and decimals of a degree, and in radians; memory. Prohibitions Calculators with any of the following facilities are prohibited in all examinations: + databanks + retrieval of text or formulae + built-in symbolic algebra manipulations + symbolic differentiation and/or integration + language translators + communication with other machines or the internetWe @ Extra online content Whenever you see an Online box, it means that there is extra online content available to support you. SolutionBank SolutionBank provides a full worked solution for questions in the book, Download all the solutions 2s a PDF or quickly find the solution you need online. Use of technology €? problems and consolidate your understanding. ‘graphically using technology. Use pre-made GeoGebra activities or Casio resources for a graphic calculator. GeeGebra CASIO. GeoGebra-powered interactives Graphic calculator interactives Interact with the mathematics you are learning Explore the mathematics you are learning and using GeoGebra’s easy-to-use tools gain confidence in using a graphic calculator Calculator tutorials naa eee Our helpful video tutorials will guide you through how to use your calculator in the exams. They cover both Casio’ scientific and colour graphic calculators. to acces the funtion press: =) OD = © eB ene tees Rinetioes ceyalicesiolleets ‘on exactly which buttons to press end what should appear on your calculator’s screenSeen uae ing this chapter you sh e and understand an algorithm > pages 5-10 ry out a bubble sort > poges 10-13 Carry out a quick sort ~ pages 13-16 ry out the three bin-packing algorithms and stand thelr strengths and weaknesses > pages 16-22 ‘termine the order of an algorithm Here is a function machine fae} onm utput v b the input lent sorting algorithms such as the quick sort all are that Given that the formula x, . to find x,,.x, and x, giving your answers t + International GCSE Mathematics “Casal ey @ Using and understanding algorithms = An algorithm is a finite sequence of step-by-step instructions carried out to solve a problem. Algorithms can be given in words or in flow charts. You need to be able to understand and use an algorithm given in words. You have been using algorithms since you started school. Some examples of mathematical algorithms that you will be familiar with are: '* how to add several two-digit numbers '* how to multiply two two-digit numbers '* how to add, subtract, multiply or divide fractions. It can be quite challenging to write a sequence of instructions for someone else to follow accurately. Here are some more examples: At the ond of the strst tur right and 0 straight over the crossroads, take the third left after the school, then . A happy’ number is defined by the algorithm: ‘* write down any integer ‘square its digits and find the sum of the squares, '* repeat until either the answer is | (in which case the number is ‘happy’) or until you get trapped in a eyele (in which case the number is ‘unhappy’) Show th a 70ishappy 2 74a 49 e 9 +7 = 130 432408 =10 4 Oat 20 70 is happy 145Re Lh Pam GENA2) ED eresn 8 Apply this algorithm, 1 Letn=1,4=1, 8: 2 Print dand B. 3 Let C=4+k 4 Print C, 5 Letn=nt+lA=B,B=C 6 If <5, goto step3 7 If n=5, stop. b Describe the numbers that are generated by this algorithm. oe ————— re See Tn Pi ch 1 1 2 i 3 2 4 2 s_lel*le 6 _[Gotostep 3 3 3 4 3 s |3lels 6 |Gotostep 3 a | 5 4 5 5s [4a[3{s G [Goto step 3 3 é 4 3S s. [s[sle 6 [Continue to step 7 7__ [Stop b This algosithm produces the first fewCMa eS ‘This algorithm multiplies the two numbers 4 and B, 1 Make a table with two columns Write A in the top row of the left-hand column and B in the top row of the right-hand column, In the next row, write the values for 4 and B. 2 In successive rows, write: j ‘ in the left-hand column, the number that J peasant’ alg ishalf of 4, ignoring remainders nultiplication algorit + in the right-hand column, the number that is double B 3 Repeat step 2 until you reach the row which has a 1 in the left-hand eolumn, 4 Delete all rows where the number in the left-hand column is even. § Find the sum of the non- 3 Let f= be. 2 Lete=ad. 4 Print S. a Apply this algorithm with the input numbers 2} and 1}. b_ What does this algorithm do? 3. The box below describes an algorithm. 1 Leta=1n=1 3 Letd=442n41. 5 If < 10, g0to2, 2 Print 4 Letuan+l 6 Stop. a Apply the algorithm, b Describe the numbers produced by the algorithm. © 4 The box below deseribes an algorithm. 1 Input 4,r, 5 Letr, is: ELD tis aiorithm recuites 4 ‘you to use the modulus 2 LetC=4to3dp 6 Goto2. fincion ifieee 9 eh Is the positive difference between xend., +C)to3dp, 8 Stop. For example: [3.2 ~7| 3 If |r~ C1 < 107 goto7. 7 Print. 4 Let a Use a trace table to apply the algorithm above when: Bandr=12 ii A=TMandr=10 iii A=4275 andr=50 b What does the algorithm produce? ® Flow charts You need to be able to apply an algorithm given as a flow chart. Ina flow chart, the shape of each box tells you about its function. Cc) <— ‘Starvend Instruction Dedision The boxes in a flow chart are linked by arrowed lines. As with an algorithm written in words, you need to follow each step in order.Ca ey GEE.) BED ws ‘The flow chart below describes an algorithm. Bot (stant Box? Let Roe 3 sg Box 4 Box S Box 6 a Apply this algorithm using a trace table. b Alter box 4 to read ‘Let £ = 31" and apply the algorithm again. How does this alter the output of the algorithm? o(e | E [bxé] bf | F [Bx6 o I a 7[2 [ne a Zz [4 | No 2 [6 | Wo 3 | € | No 3 [3 | Ne a [6 Ne. a 3 [10 | No a 6 12 No 6 18 No |” 7[ 4 | Wo 7 [at ne é 16 | No & 24 No 3 [| No 3 [7 | No [20 Yes 1—| 30] Yes Output is 2, 4, 68, 10,12 Oukeut ie 3, 6, 8, 12,15, 18, 14,%6, 18, 20 21, 24, 27, 30 This gives the first ten multiples of 3 rather than the first ten multiplesLGORITHM aa CEES) BED werrcnos This flow chart can be used to find the roots of an equation of the form ax? + bxe-+ ¢= Ca) Input e Laid =P doc vs how will this affect the output? ‘© Which box would need to be altered if the algorithm was to be applied to a list of 8 numbers? © 3 -8r+11=0LGORITHMS 3 ‘The flow chart dey 23 432-1520. bes an algorithm that can be used to find the roots of the equation a Use a= 2 to find a root of the equation, b Use a= 2010 find a root of the equation. Comment on your answer, The flow chart on the right describes how to apply Buclid’s rithm to (wo non-zero iniegers, and b. a Apply Euclid’s algorithm to: i s07and 2 (2 marks) Hi 884.and 85 (2 marks) iii 4845 and 3795 (2 marks) b Explain what Buclid’s algorithm does (2 marks) aa Tnpata { Leb = 1 isa toddp. Print b tm Input a,b, where @ > b t Let P= integer part of ab Letg= Pb t int b Ge) 5 The flow chart describes an algorithm. a Copy and complete this table, using the flow chart with A= 18 and B= 7. A B | AB? Ouiput b Explain what is achieved by this flow chart. (2 marks) c Gi Aw nn that A = KB for some positive e down the output of the flow chart. t K>* (mark)aad aS @® Bubble sort ‘Acommon data processing task is to sort an unordered list (alist which is not in order) into alphabetical or numerical order. Lists can be put into ascending (increasing) or descending (decreasing) order. ™ Unordered lists can be sorted using a bubble sort or a quick sort. © Ina bubble sort, we work through the list by comparing pairs of adjacent items (items that are next to each other) in the list. + If the items are in the correct order, leave them + If the items are not in the correct order, swap them ‘Once we have done this to all of the items in the list, we have completed the first pass. If sorting the list into ascending order, the first pass will place the largest item in its correct position in the list. If sorting the list into descending order, the first pass will place the smallest item in its correct position in the list. We then repeat this until no swaps are made in a pass. If no swaps are made then the list is in order. You will need to write that no swaps have been made. ‘As the bubble sort develops, it is helpful to consider the original list as being divided into a working list, where comparisons are made, and a sorted list containing the items that are in their final positions, To start with, all items are in the working list. Thisis the bubble sort algorithm: 1 Start at the beginning of the working list and CEELED Exch time you gettothe move from left to right, comparing adjacent items tend of the working list you complete one pass of the algorithm. The length of the pe eyecare te eats oe working list reduces by 1 with each pass. b If they are not in order, swap them. 2 When you get to the end of the working list, the -m will be in its final position. This item is then no longer in the working list 3 If you have made some swaps in the last pass, repeabiep CED trecementsin tte last 4 When a pass is completed without any swaps, bubble'to the end of thelist in the same every item is in its final position and the list is way that bubbles in a fizzy drink rise to in order. the top. This is how the algorithm got its name. You need to learn the bubble sort algorithm.LGORITHM aa El) D> «= Use a bubble sort algorithm to arrange the list below into ascending order. 4 18 37 S30 Ga1B) 37 1 1S 30 Ist comparison: ewan GED your exam you may be asked to show ‘ach comparison for one pass, but generally you will only be required to give the state of 3rd comparison: swap the lst after each pass. 4th comparison: swap 2nd comparison: leave Sth comparison: swap End of fiest pass ——_— Alter the second pass the list becomes 18 1 15 24 30.37 After the third pass the list ic 15 18 24 30.37 After the fourth pass the list is 1 15 18 24 30.37 No swaps were made in the fourth pass, 50 the list is in onder. A list of 1 letters is to be sorted into alphabetical order, starting at the left-hand end of the list. a Describe how to carry out the first pass of a bubble sort on the letters in the list. b Carty out the first pass of a bubble sort to arrange the letters in the word ALGORITHM into alphabetical order, showing every step of the working. © Show the order of the letters at the end of the second pass. '@ Starting at the beginning of the list, compare the first tno letters. IF they In position, otheraise swap them. are In alphabetical order, leave thei Continue through the fist, to the same may. end, comparing every pair of letters in M_ tot comparison: leave M 2nd comparison: snap 0) Cr cb _ mt HM 3rd comparison: leave T HM Ath comparison: leave it H fi RaDD M_ Sth comparison: swap 6 - Act OCR 6th comparison: leave A GLO 7th comparson: swap A GLO 8th comparison: svap A G€ LO nCasal ey Use a bubble sort to arrange these numbers into descending order. 39 57 GD 297 m4 97@9 7D) 39 17 24 40 57 72G0 317 24 48 57 72 399 1D 24 48 57 72 39 30@7 2D 40 57 72 30 39 247 A 39 24 48.17 57 72 0 4 48 39 < 57 so swap 39 < 72 s0 swap 39 £29 s0 leave 39 £17 soleave 17 < 24 90 nap 17 < 48 50 swap Alter tot pass: 57 72 39 39.24 4617 4th pass: Alter Sth poss: 72 57 48 39.39 24 17 No swaps in Sth pass, $0 the list is in onder GEREN ELD weomcncoss 1 Apply a bubble sort to arrange each list below intor a ascending order iB 6 15 iN EB T ii AS D3 D2 b descending order 341825, woo oR Al BS C7 u K C2 19 s B3 For each part, you need to show the state of the list only at the end of each pass, Aiter Ond poss! 72 57 39 39 48 24 17 ee eee ee _— faassen Ait 72 57 46 39.39 24 17 GED rer parit, order ‘alphabeticaly then numerically res after AS but S02 com before C7. 2 Perform a bubble sort to arrange these place names into alphabetical order. Chester York Stafford Bridlington Burton Cranleigh ® 3 Allist of m items is to be written in ascending order using a bubble sort @ State the minimum number of passes needed. b Describe the cireumstances in which this number of passes would be sufficient. © State the maximum number of passes needed Describe the circumstances in which this number of passes would be needed EveshamLGORITHM aa © 4 Hereisa lst of exam seores 63 48 57 SS 32 48 72 49 61 39 The scores are to be put in order, highest first, using a bubble sort, a Describe how to carry out the first pass. (2 marks) b Apply a bubble sort to put the scores in the required order. ‘Only show the state of the list at the end of each pass (marks) @® Quick sort The quick sort algorithm can be used to arrange a list into alphabetical or numerical order. In many cases, a quick sort is faster to perform than a bubble sort. We can thus say that it is more efficient. Ina quick sort, we choose an item which we call a pivot, and split the items into two sublists: + One sublist contains items less than the pivot. LIZTD iran item is equal to the + The other sublist contains items greater than the pivot. Blipetrrang In enher ab ist: Once we have done this we have completed the first pass. In doing the quick sort, the first pass will place the pivot item in its correct position in the list. We then repeat this until all items are chosen as pivots, and then the list is in order. You will need to write that all items are chosen as pivots, which means that they are in order. Here is the quick sort algorithm, used to sort a 1 Choose the item at the midpoint of the list to be the first pivot. 2 Write down all the items that are less than the pivot, keeping their order, in a sublist. —— 3 Write down the pivot 4 Write down the remaining items (those greater ‘than the pivot) in a sublist. 5 Apply steps 1 10 4 to each sublist. 6 When all items have been chosen as pivots, stop. ‘The number of pivots could double at each pass. There is 1 pivot at the first pass, there could be 2 at the second, 4 at the third, 8 at the fourth, and so on.Pm at LES Example @) sia Use the quick sort algorithm to arrange the numbers below into ascending order 2 24 42 29 23 1 8 39 38 2 24 42 29 @D 13 6 39 36: Forn items, the pivot will be the "+ th item, rounding up if necessary There are 9 numbers in the list so the Tikal be 222 5 othe pots 38 the Sth number in the list. Circle it. Write ali the numbers less than 23. 3 8 4 42 29 39 36 | Wine’ pet aboeltnen yma the 42 39 38-—)— remaining numbers. it clonal 1) (003) ED ES) 24) ES] BE) BD A pivors circled, 8 21 24 38 39 42 21 3B We can choose only two pivots tis time. Each — number has been chosen as a pivot, so the list is in order. Gx) EEE rroa.cn sore Use the quick sort algorithm to arrange the list below into desc 37-20 :«17:«26 «44 4127 28 S017 ding order. ‘There are 10 tems inthe lst so the midpoint willbe "°°" 5.5, and so the 2 pivot is the 6th numberin the list. Circle 37 20 7 26 44 @ 27 2 50 17 8 [4] #7 20 on aa Mw ‘Numbers greater than the pivot are to the L_1 1 avortne pict those sate than the LI@E 7 @2kla@ 1 pivotareto the right keeping the numbers i | inorcer Numbers equal to the pivot may go either side, but must be dealt within [50] [44] [41] 27 the same way each time you do a pass. FF GSI) || Meiers are chosen, one for each sublist 44] [21] @D (26) [27 l Now three pivots are selected. 4441 37 28 27 26 20 7 17 We now choose the next two pivots, even ifthe sublists incrder CED cours used tere tormake the method clear, but colours should not ‘The final pivots are chosen to give thelist be used in your exam. —~ in orderLGORITHMS aa EN 5) ELE conc ancora 1 Usea bubble sort to arrange the list of numbers below into: a ascending order b descending order 8 3 4 6 5 7 2 2. Use the quick sort algorithm to arrange the list below into: ascending order b descending order 2 17 2 3 I 1 2 4 7 @ 3 Sort the letiers below into alphabet al order using: aa bubble sort b aquick sort N H R K S C JE M POL 4 The list shows the test results of a group of students, Alex 33 Hetal 9 Alison 56 Janelle. 89 Amy 93 Josh ” Annie SI Lucy 7 Dewei 77 — Masingur 19 Greg 91 Sam 29 Harry 49 Sophie 77 Produce a list of students, in descending order of their marks, using: a a bubble sort b a quick sort GBP) § A list of items is to be written in ascending order using the bubble sort algorithm. a Find an expression, in terms of », for the maximum number of comparisons to be made. (2 marks) b Describe a situation where a bubble sort might be quicker than a quick sort (2 marks) © Decide whether a bubble sort or a quick sort will be quicker in the following cases: il 2 3 7 4 5 6 #2 3 4 5 6 7 1 Explain how you made your decisions. (4 marks)Ca TS) © 4 The table shows alist of nine names of students in a dance class Hassler | Sauver | Finch Giannini] Mellor |Clopton | Miranti | Worth | Argi H s FE G Me ¢ Mi Ww A_| a Explain how to carry out the first pass of a quick sort algorithm to order the list alphabetically @ marks) b Carry out the first two passes of a quick sort on this list, writing down the pivots used in each pass. marks) Caer EXE ou will need « pack of ordinary playing cards, with any jokers removed. oe innovation A pack of playing cards has 52 cards, spit into & suits: ae Hearts @ Diamonds @ Clubs Spades @ There are 13 cards in each suit, a5 follows: Ace (1), 2,3, 6,5, 6 7,8, 9,10, jack (11), Queen (12), King (13) {8 Use the quick sort algorithm to sort the cards into ascending order, from Ace to King within each suit and with the suits in the order: Hearts, Clubs, Diamonds, Spades, Follow these steps: 1. Shuffie the pack thoroughly and hold it face up, 2 Remove the 27th card and place it face up. This Is our pivot card, 3. Go through the pack from the top. Place the cards into tno piles ‘depending on whether they are lower or higher than the pivet card. 4 Repeat these steps with each new pile, choosing the card halfwey through the pile as the pivot card, Record the total number of passes needed to sort the deck completely. 'b Once the cards are in order, what single change could be made so that a ‘bubble sort would require 51 passes to put the cards back in order? KY. Ade, 2am. KB ©) Bin-packing algorithms Bin packing refers toa whole lass of problems. ‘The easiest way of thinking about this algorithm is to imagine boxes of fixed width « and length +, but varying heights, and stacking them into bins of width a and length A, using the minimum number of bins. ‘s aee) aa Similar problems are: loading cars of different lengths onto a ferry with several lanes of equal length, a plumber needing to cut sections from lengths of copper pipe, or recording music tracks onto a set of CDs. You need to be able to apply three different bin-packing algorithms, and be aware of their strengths and weaknesses. 1 The three bin-packing algorithms are: first-fit, first-fit decreasing and ull-bin. leis useful to first find lower bound forthe number (7p of bins needed. There is no guarantee that you will be ASP ERA st ons Coe that cannot be improved upon. For bin able to pack the items into this number of bins, but it . ill tell you If you have found an optimal solut packing, an optimal solution will use the wiltellyou Ifyou have found an optimal solution. smallest possible number of bins. EO 2) ELE worse Nine boxes of fixed cross-section have heights, in metres, as follows, 03°07 08 08 LO I LI 12 Ls They are to be packed into bins with the same fixed cross-section and height 2m, Determine the lower bound for the number of bins needed, 3407408406 4104411412 415 =85m 4.25 bing 50 minimum of S bins wil be needed. See narasan nee simp ilbe needed With small amounts of data itis often possible to’spot’ an optimal answer. ‘The algorithms you will lear in this chapter will not necessarily find an optimal solution, but can be applied quickly. © The first-fit algorithm works by considering items in the order they are given. First-fit algorithm 1 Take the items in the order given. 2 Place each item in the first available bin that can take it, Start from bin I each time, Advantage: tis quick to apply. . Disodvantage: Iti not likely to lead to 0 good solution. EDD se open ae aaC at er LU ETN 5) EE ocornerveren ‘Use the first-fit algorithm to pack the following items into bins of size 20. (The aumbers in brackets are the size of the item.) State the number of bins used and the amount of wasted space. AQ) BG) C4) DO) EH) FQ).--G(S) HS) (6) 7) KS) Bint Bin2 Bind Bind Bind Bing This used 6 bina and there are 24+5+7 +412 = 26 units of waste 1 The first-fit decreasing algorithm requires the items to be in descending order before applying the algorithm, First-fit decreasing algorithm 1 Sort the items so that they are in descending order. 2 Apply the firs-ft algorithm to the reordered lst. Advantages: You usually get 2 fairly good solution. It is easy to apply. Disadvantage: You may not get an optimal solution. Example QQ) sks Santas Apply the first-fit decreasing algorithm to the data given in Example 13 Sort the data into descending order 1115) C(14) D(9) 119) AE) KO) B(7) J(7) ECE) KE) CIS) Bint Bin2 Bind Bin4 Bind This used 5 bins and there are 2 +4 = 6 units of wasted space.LGORITHM aa = Full-bin packing uses inspection to select items that will combine to fill bins. Remaining items are packed using the first-fit algorithm. Full-bin packing 1 Use observation to find combinations of items that will fill a bin. Pack these items first. 2 Any remaining items are packed using the first-it algorithm. Advantage: You usually get a good solution. Disadvantage: It is difficult to do, especially when the numbers are plentiful and awkward. GENES) LED corres A) BI) CU), DU) BU3) FUT) GG) HG) 102), Jd) K) The items above are to be packed in bins of size 2: a Determine the lower bound for the number of bins. b Apply the full-bin algorithm. ¢ Is your solution optimal? Give a reason for your answer. a i= 25=444 So lower bourd is 5 bins. b Three groupings of numbers that sum to 25 can be made as follows: 847 +10=25 44 Bint Bind Bind Bina Bn = We now apply the first-fit algorithm t Bint Bin2 Bin3 Bind Bin S © The lower bound is 5, and 5 bins w used, 20 the solition is optimal 19Ua a eS Example @) ‘A plumber needs to cut the following lengths of copper pipe. (Lengths are in metres) AS) BOS) Cll4) DUL1) EM.3) FO) GOS) HO) 108) 110.9) ‘The pipe comes in lengths of 2.5m. a Calculate the lower bound of the number of lengths of pipe needed. b_ Use the first-fit decreasing algorithm to determine how the required lengths may be cut from the 2.5m lengths. ¢ Use full-bin packing to find an optimal solution, TIED eccurveruncrion 2 OOFO6 +14 411413 +09 +05 +09 +06+09 “2 =388 So at leant 4 lengths are require scending order, Fi09), H1O32), HO), AOL), BOB), G08); 10.8) Bin? Bin2 Bin3 Bind Bnd | © By inspection, Cha) + BI) = 25, FiO) + A(0.8) + BIOS) JOS) + GO) +108) = 25 A fullzbin solution ist Bint Bin2 Bind BindLGORITHMS aa 1 EEEND EID owcmnarnes 8 B42 7 1 3 2% 3 35 32 The above items are to be packed in bins of size 50. a Calculate the lower bound for the number of bins. b Pack the items into the bins using: i the first-fit algorithm ii the first-fit decreasi algorithm i the full-bin algorithm, Laura hosts an internet music channel and wishes to play the 13 pieces of music listed below. Each day, she hosts a session which is at most 3 hours long. Pieceotmusic | A[B[C|D{[E/F[GlH[t]s[K[L[u Length (minutes | 30 | 30 | 30 | 45 | 45 | @ | 60 | oo | 60 | 75 | 9% | 120] 120 a Apply the first-fit algorithm, in the order A to M, to detes to be used, State which music is played on each day. b Repeat part a using the first-fit decreasing algorithm, € Is your answer to part b optimal? Give a reason for your answer ine the number of days that need Laura finds that her session time is now reduced to only 2 hours, 4 Use the full-bin algorithm to determine the number of days she needs to use. State which music is played on each day. A small ferry loads vehicles into 30m lanes. The vehicles are loaded bumper to bumper. Vehicle [Length (m) Vehicte [Length (am) A car 4m F car 4m B [earandtrailer) 7m GI] tony 12m € lorry Bm H | lory lam D van om 1 van 6m E| tony | im J lorry Um a Describe one difference between the first-ft and full-bin methods of bin packing. (1 mark) b Use the first-fit algorithm to determine the number of lanes needed to load all the yehieles onto the Ferry. (4 marks) © Use a full-bin method to obtain an optimal solution using the minimum number of lanes. Explain why your solution is optimal (4 marks) The ground floor of an office block is to be fully recarpeted, with specially made carpet incorporating the firm’s logo. The carpet comes in rolls of 15m. following lengths are required. A3m Dam G5m J 7m B3m E4m Hsm K8m c4m Fam 15m L8m Falead TS) ‘The lengths are arranged in ascending order of size. a Obtain a lower bound for the number of rolls of carpet needed. (2 marks) b Use the first-ft decreasing bin-packing algorithm to determine the number of rolls needed State the length of carpet that is wasted using this method G marks) © Give one disadvantage of the first-fit decreasing bin-packing algorithm. (mark) d_ Use a full-bin method to obtain an optimal solution, and state the total length of wasted carpet using this method, marks) Eight computer programs need to be copied onto 40 GB USB sticks The size of each program is gi Progam [A | B|[C|D|E|F[G Size (GB) | 8 | 16 [7 | 2 | 22 | 4 | 2s below a Use the first-fit deereasing algorithm to determine which programs should be recorded onto each USB stick. G marks) b Calculate a lower bound for the number of USB sticks needed marks) S a Consider the programs over Explain why it is n ible 1d these programs ‘¢ Explain why it is not possible to record these program: oe on the number of USB sticks found in part b, (1 mark) @BD Binary search You need to be able to carry out a binary search. Abinary search will ook through an ordered lst to find out whether or not an item you are trying to find isin the list. Ifthe item isin the list, the binary search will locate its position within the list. If the list is not in order, then you may need to use a bubble sort or quick sort to put the items into order first. * Ina binary search, we look at halving the size ofthe lst each time we perform a pass. + Ina binary search, we locate the midpoint of thelist using "+, We call this the pivot. Like with the quick sort, we round this up if itis not an integer. + We compare this midpoint with the item we are trying to locate; this will help us decide which half of the list to choose. + Eventually we will get to one item - it will either be the item we are trying to locate, ort \will not be. In this case we can say that the item we were trying to locate is not in the list. Here is the binary search algorithm to locate an item in a list: 1 Select the midpoint of the list using “1 and round up if necessary. This is the pivot 2 a If the pivotis the item we are locating, then the search is complete. b If the pivot is after the item we are locating, then we look in the first half of the list. € If the pivot is before the item we are locating, then we look in the second half of the list. 3. Repeat steps 1 and 2 to each remaining list until the item is located. If the item is not found, then it is not in the list.Meant aa Use the binary search algorithm to try to locate these names in the list that follows a Robinson b Davies 1 Acharya 6 Laing CEM eememt 2 Blackstock 7 Leung ar 3 Cheung 8 Robinson 4 Coetzee 9 Saludo 3. Fowler 10 Xiao a The middle name Is the: 6 Laing Robinson Is after Laing, so the list reduces to 1 Leung 2 Robinson 3 Saludo 4X0 The middle name in this sublist Is the 441 At = 2.5) 3rd name: 3 Saludo Robinson is belore Saludo, 20 the list reduces to: 1 Leung 2 Robinson The middle name in this subist Is the ees D1) and nae 2 Robinson The search is complete, Robinson has been found in the list. 1041 b The ide noneis the (2 58) ct one € lag Davies is before Laing so the ist reduces to: 1 Acharya 2 Blackstock 3 Cheung 4 Coetzee 5 Fowler | The middle name is the = 3) 3d name ~—— Geiderthe tt afer tre phot 3 Cheng Davies is alter Cheung 20 the lst redces to 1 Coetzee 2 FowlerCasal TS) lst before the pi The middle name is the = 15) and nome: ‘only one item which is n Its important to write th | 1 Use the binary search algorithm to try to locate these names in the list that follows: a Connock b Walkey © Peabody 1 Berry 5 Tapner 2 Connock 6 Walkey 3 Li 7 Wilson 4 Sully 8 Wu 2. Use the binary search algorithm to try to locate these numbers in the list that follows: a2 bs 13 a7 715 918 121 24 49 613 817 10 20 12 24 © 3 The binary search algorithm is applied to an ordered list of 1 items Find the maximum number of times the algorithm is run when 1 is equal to: a 100 b 1000 © 10000 4 a Use the quick sort algorithm to put the list below into ascending order. 1 Adam 6 Ramin M1 Of 16 Miranda 2 Ed 7 Alex 12 Lotus 17 Matt 3 Lei 8 Emily 13. Des 18 Katie 4 Lottie 9 Felix 14 George 19 Doug 5 Saul 10 Leo 15 Jess 20 Hongmei b Use the binary search algorithm to try to locate: i George ii David Chapter review 1 Use the bubble-sort algorithm to sort, in ascending order, the list 7 15 2 B® 6 1 giving the state of the list at each stage. (4 marks) JessLGORITHMS 2 aa a Use the bubble-sort algorithm to sort, 3 2 HW DR 6 AI giving the state of the list on each occasion when two or more n descending order, the list values are interchanged (swapped), (4 marks) b Find the maximum number of interchanges needed to sort a list of six pieces of data using the bubble-sort algorithm, (marks) 8 4 2B 17 9 45 This list of numbers is to be sorted into ascending order. Perform a quick sort to obtain the sorted list, giving the state of the list after cach rearrangement. ( marks) Hl 103-77 St B BBS 93 a The list of numbers above is to be sorted into descending order. Perform a quick sort to obtain the sorted list, giving the state of the list after each rearrangement and indicating the pivot elements used. (S marks) b i Use the first-fit decreasing bin-packing algorithm to fit the data into bins of size 200. Gmarks) ii Explain how you decided in which bin to place the number 77 (mark) ‘Trishna wishes to record eight television programmes. The lengths of the programmes, in minutes, are: 75 100 52-9230 BAD ‘Trishna decides to use 2-hour (120 minute) DVDs only to recont all of these programmes a Explain how to apply the first-fit decreasing bin-packing algorithm. 2 marks) Use this algorithm to fit these programmes onto the smallest number of DVDs possible, stating the total amount of unused space on the DVDs. G marks) ‘Trishna wants to record an additional two 25-minute programmes, € Determine whether she can do this using only $ DVDs, giving reasons for your answer. (marks) the table, A DIY enthusiast requires the following 14 pieces of wood as shows Tewthinmeres [04] 06] 1 [12] 14] 16 [Number of pieces | 3 | 4 | 3 [oe The DIY store sells wood in 2m and 2.4 m lengths. He considers buying six 2m lengths of wood. a Explain why he will not be able to cut all of the lengths he requires from these six m lengths. 2 marks) b He eventually decides to buy 2.4m lengths. Use a first-fit decreasing bin-packing algorithm to show how he could use six 2.4m lengths to obtain the pieces he requires. (marks) © Obtain a solution that requires only five 2.4m lengths. (marks) 25ea alsd TS) @®) 7 Thealgorithm described by the flow chart below is to be EES) this question uses the applied to the five pieces of data below, edulis functions face y, b= 1 = 6.1, t= 6.9, uy = 5.7, y= 48, t Is the positive difference between xand yeg.[5~61)= 11. a Obtain the final output of the algorithm using the five values given for u; to us (4 marks) b In general, for any set of values x, to ws, explain what the algorithm achieves. Q marks) Box | Temp Box? intel Box 4 Box 5 Box 6 Box7 Print A ¢ If Box 4 in the flow chart is altered to state what the algorithm achieves now. (1 mark) 8 A plumber is cutting lengths of PVC pipe for a bathroom, The lengths needed, in metres, are 03°20 13 16 03 13 02 O1 20 05 ‘The pipe is sold in 2m lengths a Carry out a bubble sort to produce a list of the lengths needed in descending order. Give the state of the list after each pass. (marks) b Apply the first-fit decreasing bin-packing algorithm to your ordered list to determine the total number of 2 m lengths of pipe needed. GB marks) ¢ Does the answer to part b use the minimum number of 2 m lengths? ‘You must justify your answer. Q marks)LGORITHMS aa GB) 49 Here are the names of eight students in an A level group: Manisha, Vivien, Cath, Alex, Da Ming, Beth, Kandis, Sze-To Use a quick sort to put the names in alphabetical order. Show the result of each pass and identify the pivots. (S marks) 10 A binary search is to be performed on a list of names to try to locate Kim. 1 a 3 4 5 Jenny 6 Hyo Merry 7 Kim Charles 8 Richard Ben 9 Greg Toby 10 Freya a Explain why a binary seareh cannot be performed with the list in its present form. (1 mark) b Using an appropriate algorithm, alter the list so that a binary search can be performed, showing the state of the list after each complete iteration. State the name of the algorithm you have used. (4marks) © Use the binary search algorithm to locate the name Kim in the list you obtained. in b. You must make your method clear (4marks) a