woo neyeur MMA: http://www.makaut.com COB Teoh ATION SEMSUTSOLROIS LT SRR SS MAULANA ABUL KALAM AZAD UNIVERSITY OF “TRCURNOLOGY, WEST BENGAL Paper Code : IT-501 DESIGN AND ANALYSIS OF ALGORITHMS Rowe Alosrad Sours Pull Marks 70 The figures in the margin indicate full marks, Candidates are required to give their answers in their own words . as far as practicable, Group-A {Maltipte Choice Type Questions) LG Choos the correct alternative foreach of the follow! 'x10=10 a sks sounce shoutest path in a graph having negative edge ean be solved by. A) realy method AV Grecdty mettuad and Dynamic progenmmning WS) Dynamic programming only WH None of the above AH) A mattis chain having $ matrices ean be parenthesized in ja) 14 different combinations: BY 15 ditverent combinations (1 diferent combinations “AQ None of the abowe {iii) The worst-case time complexity of Merge Sort is ta) OW") wb) O(log») we) 0@) wt) O(rlogn) ‘Turn Over http://www.makaut.com woo jneyeuraMmar//:dyywoo neyeur MMA: http://www.makaut.com COAL Tech ATOMUSEM AT SOL 201K HY (Wy Which of the following susttig procectanes is the: slowest’ QW Quick sont (6) Heap suet {e) Shall nati AF Hullo non (9) A tis of 1 otulies, cucli of length ty sorted laxicewweaphe ender sing the merue-seet algeattti The worst nse Hunt, thie oF this coniputtbon te Auy O(a tog) (by Or tog) (ey Or boy ny (d) O(n4y (Wi) ‘the space factor deterintaing the effielency of algenithion ts Aa) county the maxima memory needed hy the alyositiun (by counting the enn iemnary needed! Wy the: alyerithun (6) counting the average menuay needled by the algorithm (2) counting, the amaxtmn disk space needed by the: alycritbun (vit) ‘The computing tine of Job Seeyuenchny probe cau be rcaluced froan O(n) ws OC} by using a) backtracking algositinn , branets sid bound alyorithin int ret anion and find alyorithans (dl) divide and conquer algenithin (viii) ‘The main different between Dynunie proprxanning sand Crecedy algorithm is (a) in Greely algorithin snany dectston sequences may be penerated tat in Dynamic Programmning nly one decinion is ever generate, (by in Greedy alyoritiun only os decision sequences may be (6) Greedy metloxt always gives optinal solution bul in Dynomle Prograrnning etimal solution may sot be obtained, (d) None of the shove decision 1s ever yenerave ut in Dynamic Progsamming many erate, (ix) ‘The nondeterministic tine complexity uf wsarching problem ts {ay On loyen) (by O(n?) (©) og, n) poy 2 http://www.makaut.com woo jneyeuraMmar//:dyywoo neyeur MMA: yeep http://www.makaut.com COM.Tech NT/OUUSEM-SAT 501201819 (x) Time complexity of the recurrence relation T(x) = f@ Gtmnz2 vino constant,n = 1 {a) O(logz n) (b) O(n log, n) er O(n? (@) O(n) Group -B (Short Answer Type Questions) Answer any three of the following. = Explain satisfiability problem and Cook's theorem. 5 ‘Write an algorithm for Graph Cotoring Problem. What isthe time complexity of your algorithm? 4+1=5 Derive the worst case time complexity of merge sont. hitp://www.makaut.com : 5 ‘Write an algorithm (o insert an element into a heap. What is the complexity of your algorithm and why? 34255 Write a recursive algorithm for finding maximum and minimum from a list of elements, Also find the complexity of your algorithm. 34255 Group -C (Long Answer Type Questions) Answer any three of the following, I5x3=45 nd Kruskal’s algorithm, Write an algorithin for “Weighted Union”. Find ig tree using Prim’s algorithm for the graph given below. Explain the Differentiate between Prin the minimum cost_spann complexity of Prim’s and Kruskal algorithm. 3424347215 http://www.makaut.com woo jneyeuraMmar//:dyywoo neyeur MMA: http://www.makaut.com CSM. Tech ATIONUSEM-SHTSOL201819 % 10. ue (a) Discuss the procedure for Stssen'w ately multiplication tw evalunte the procluet of n matiiees, Vind the resulting reeurreneo relation far tho sume and analize its lng complexlty, Justify cha this wethod is an improvement ovee the conventional matrix multiplication method, (0) How can you fin! a solution of simultaneous linewr equation using LUP decomposition? . Tela 242a3als (a) Using Knuth Morris Pratt algbrithin, Gnd whether the patie P= (00-10), is in the text SIL 10001 1010001010) arnot, (oA sequence of » operations is performed on a data steueture, ‘the ith operation costs LIC Is an exnct Power of 2, and 1 otherwise. use an accounting method und potential method to determine the amontized cost per operation, . 51446215 (a) Write and ex ain the classes of B, NP, NP-hard and NP-Complete, (b) What is redueibitity? (©) Write down the algorithm of nondeterministic sorting, (@ “ICany NP complete problem can be solved in polynomial time then P = NP"— Discuss. SeQedectel § Write short notes any shirce of the fotlowing: Sx3215 (a) Union-Find Algorithm & Union by Rank (b) TSP sing Approximations Algorithm —-rveauelliy tellt mea pred. (©) Asymptotic notation (@) Vertex Cover Problem (¢) Ford Fulkerson Algorithm http:/www.makaut.com Whatsapp @ 9300930012 Your old paper & get 10/- geet tend sat atte 10 wat or, Paytm or Google Pay # http://www.makaut.com woo jneyeuraMmar//:dyy