Save trees use e-Question Paper Go green DOWNLOAD THIS FREE AT www.viuresource.com CE COS CHEN ES us | | 17C843, Fourth Semester B.E. Degree Examination, Aug/Sept-2020 Design and Analysis of Algorithms inne: 3 hs. Mas aie 100 ‘Note: Answer any FIVE full questions, choosing ONE full question from each G, Module-1 1a. Define an algorithm. Explain the characteristics ofan algorithm, as) What are Asymptotic notions? List and desribe the various asyiffe wore with an example ofeach uma) . Explain the gotenl plan of mathematica! analysis of now-offi ‘wth an example ‘or Mans # OR FE 2 a Whatithe wort case test cas and averge cise effiencics Magu search? i (04 Maes) A ', Mustete mathematical analysis of recursive algorithm Sra ani problem, i ‘os mans) f ‘¢._ Discuss the impoztant problem types and fund: AMgtructures (08 Marks) ' 2 3a. Diseuss how Quick sort algorithm workgirt aNFnd trace forthe fllowing da set Draw the tee of recursive cals made, ‘Ray eating ed enifono sped trakiner ood x oprton ven og vs 50, cor renal as mabesice a 7 (10 Marks) i & Phown in Fig Q3(t), using source removal i i 2 “ig-Q3(b) (06 Maris) FA tistoutgeedgges ana PMivanages divide and conquer ecnigue. Oran ' on rr, x tcchique wit contol section. (ers) fe “8. Drop song ceavats wing Simple merge, Apply te same or sorting : tis a é (08 Marks) 25 eAgpniysussen's algorithm to compe 3 02 1] [010 ") 5 4110) j2 104) i * (08 Marks) i 013 0l|z017% = so21} 13s 0} Lot4 Vy, RANCHES | ALL SEMESTERS | NOTES | QUESTON PAPERS | LAB MANUALS. A Vturesource Go Green initiativeSave trees use e-Question Paper Go green DOWNLOAD THIS FREE AT www.viuresource.com wo C) ‘Module-3 5 a. State Job sequencing with deadline problem. Find the solution generated by job sequenci problem for 7 jobs given profits 3, 5, 20, 18, 1, 6, 30 and deadlines 1, 3, 4, 3, 2, respectively. '. Explain the concept of greedy technique for Prim’s algorithm. Obtain 2 spanning tree forthe graph below in Fig.QS(b) a! 3 Fig.Q5() (osatariy) ©. Sor the given list of number us 2 T7711 Té I sma) oR 6 2 Explain Greedy criterion. Apply greedy met Ning instance of knapsack problem. Capacity ofthe knapsack (M) = 5. ma Toten | We T costars) 'b. Constuct a Husinan code for ia and encode the test BADE Character | A | Probability [04 (6 Maris) Solve the below ins the source, ~\ Module-t 7. a. Qa is Dynamic programming? Using Warshal’s algorithm, ebtain the transitive closure of rang tine by the following adjacency mat 0100 196(c) of single souree shortest path problem with vertex a as (06 Marta) coor 5 Mark R aa tink) 10 2of4 BRANCHES | ALL SEMESTERS | NOTES | QUESTON PAPERS | LAB MANUALS A Vturesource Go Green initiativeSave trees use e-Question Paper DOWNLOAD THIS FREE AT www.viuresource.com 170843 'b, Define multistage graph problem. Determine the minimum cost path fiom source (S) sink (1) forthe graph in Fig,Q7() using forward T Fig Qi) oR 8 a Explain Travelling Salesperson Problem (TSP «dynamic programmin 1 3 To | “to | 150, zs [0 [9 3,6] 3 |e 2 are [8 0 contests) pelow instance of TSP using 8 Maris) M 3of4 (Obtain optimal Binary sear 6 owing identifiers. 1g afi) [ao ‘at while pli) FOr foros | 03 (2 Marks) to solve the below instanceof the subset sum problem. Module:5, opffeneraie solutions to 4-Quesn’s problem, (os marts) a (0s Marts) and Wind technique othe following insurance of assignment problem. job (sats) Go green a & Fig QT) Solve the below instance of Bellman-Ford algorithm Fig. Q7()]- mo BRANCHES | ALL SEMESTERS | NOTES | QUESTON PAPERS | LAB MANUALS A Vturesource Go Green initiative