Save trees use e-Question Paper Go green DOWNLOAD THIS FREE AT www.viuresource.com Ges SCMEME omg T r7es4 Fourth Semester B.E. Degree Examination, Dec.2019/Jan.202 Design and Analysis of Algorithms ‘Time: 3 hes Max. Marks: 100 ‘Note: Answer any FIVE full questions, choosing ONE full question from, ute i Modute-t Ba xpi Aryrplatic notations in detail with example Marts) ZB. Outline an algorithm to find maximum ofn elements and obtain a ‘os Maris) 3 on i 2a, Design algorithm for tower of Hanoi problem and obtain di comple (10 Marks) § Prove the theorem a it f(a) € 0¢e, (a) and fn) £0 (s(n) Then fica) # feuim, gm. as Wo Marks He ae algorithm for binary se 1ecomplexiiy, 10 Marks) dpe. algort for merge sort and T 5,35, 25, 75.30. 0 Marks 5: EE 4 2 Developanalgrithm for Quick soggy da complexity (0 Mtas) What is topalogial sorting? Ap} raph to sve topological sort a0 aa Fig Qaiby C ae 2a recap Rhee, ars aascami ey ace ee ets ey ese arto {astar{orferfor CPreit_[10 [os is is [03 egy ie: wn Kets api g G « BRANCHES | ALL SEMESTERS | NOTES | QUESTON PAPERS | LAB MANUALS A Viuresource Go Green initiativeSave trees use e-Question Paper Go green DOWNLOAD THIS FREE AT www.viuresource.com r1C843 oR Fig. Q6(by Ta example 0 Marks) b tan optimal binary ssarch tre for the follow ems: i Probabilities | 0. (10 Marks) 8 a. Design Floyd's algorithm to find shortest all nodes to all other nodes, (10 Macks) b. Apply Warshall’s algorithm to compute t ire for the graph below. (Marks) . Jima solion augment problem gtr: Dat [de afer ts rs betas 7 esa} ite] i ste] ‘oars BRANCHES | ALL SEMESTERS | NOTES | QUESTON PAPERS | LAB MANUALS A Viuresource Go Green initiative