Save trees use e-Question Paper DOWNLOAD THIS FREE AT www.viuresource.com esnips CSCS Seta sn ‘ONE full question from each modul ‘Module-1 ‘What isan algorithm? What are the properties of an alggyihMjyplan with an example ‘eestats) Explin the general plan for analying the eficgaey of 2 Wigsive algorithm. Suggest @ recursive algorid 6 find factorial of 3 number, Bie is eT. (ston) en) € Ofer) and i) € Ofes(n) roy 0 ‘O¢maste.cn, en) (291089) R Explain the asymptotic notations 6 ar) Distinguish between the two comm Rays present a graph (sori) Discuss shout the imponat yng fundamental data structures. stars) Discs tow who Soran ary and nce fr the lowing dt st, Deo the soot 70 [5 | 80] 8 | 6 | 55 | 0] a5 | Pip lexity of quick sort algorithm, (10 vats) eases matrix silicon, Obtain its tie complexity. (6 Marks) oR sai! ‘of divide and conquer. Design an algorithm for merge som and derive ts Laddeonplesit a Whar are the tae major variations of deerease and conquer technique? Fxplin sample french (We stad ots a “€) aes Go green 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 i © 5 a. Explain the concept of greedy technique for Prins algorithm, Obtain & minimus spanning tree forthe graph shown in Fig. Q3¢3), (es fies) Q: Fig. sca) bh, Solve the below instance of the single source shortest pai sity 6 a the source, With the help ofa suzable algorithm. (os stars 6 a. What are Huffman ces? E plain gira Mtutinan code forthe following date Chi A CDT FE] - Pegi 035 [os por }usy 02 Encode DAD_CBE Pan ePoding asst 1 ESplain transform glleong uc. Sor the below fist wing Heap sont B24 163 (assay ite Warsall’s algorithm to compute transitive ‘Apiy eso he rp csfocd by te folomh adicees satan amie programming solve the below instance of krapsick problem, (@8 Mars) Them | Weight | Valve ] 2 TO | Capacity w= 5 20 T 5 2 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 1scs43 on ‘Obtain a optima binary search we for he following four-Ke Set os — Tx [aa poasiig OL] wa arf or | Solve the following travelling sales person problem represented as 2 graph show Fi Q84b, using dynamic programming oe Fig.oRb) Module. 9 4. What isthe cenal principle of back king to solve the helow instance of um of subse robles $= 5,10, 12, 13, 15,18) d= 30. Solve the belw instance ofassignmes ws tas) och and bound algorithm. 8) Persona 7 7 | Person 8 | Person ¢ 94) personal (os sary oR 10 a rate solutions to 4-Queen’sprblem, westansy & cin of finding 3 Hamikonian circuit in the arate shown (ostias) fe? Fig.Q10G) ity RP complete problems ) NP hard problem. (08 stats) 3083 BRANCHES | ALL SEMESTERS | NOTES | QUESTON PAPERS | LAB MANUALS A Viuresource Go Green initiative