Scribd
Upload
93 views15 pages

Daa All Papers

Design and analysis of Algorithms previous papers

Uploaded by

Kushagra Varshney
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
93 views15 pages

Daa All Papers

Design and analysis of Algorithms previous papers

Uploaded by

Kushagra Varshney
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 15
ttpz/iwww.kuonline Roll No. ou ‘Tal Pages : 2 BI-SDX 8501 2 DESIGN AND ANALYSIS OF ALGORITHM Paper : CSE-301 Time : Three Hours} [Maximum Marks : 100, Note : Attempt ive questions inal, electing at east one question from each uni. UNIT 1. What is Heapsort ? Write an algorithm to sort elements sing heapsor. Show the steps for the following list (40, 80, 35, 90, 5, 50, 70) Analyze its Time complexity and compare it with quick sort. 20 2 What is Binary search ? Write the algorithm to search an clement using binary search with suitable example, Analyse Its time complexity and compare it with linear search. 20 UNIT-T 13. (a) What are binomial heaps ? Explain with example. 10 (©) Explain the optimal polygon triangulation technique. 10 4. (2) What is dymamic programming ? Explain its use in problem solving. 10 () Describe the Huftinan codes it brief 10 8501/6400/KD/1764 Pro. ttp:iwww.knonli ttp:iiwww.kuontine. UNIT 5. (a) Explain he topological sont with example 10 (8) Explain the Johnson's algorithm for shortest path. 10 6." Write the Prim’s algorithm for Gnding minimum spanning tree. Analyze its time complesity. Compare it with Kruskal’s algorithm. Apply the Prim’s algorithm for the following graph 20 UNITAV 7. (@) What are Flow networks ? Explain their use in brie 10 (©) Explain the Bitonic sorting network. 10 8. Write short notes (2) Comparison network () Merging network loo 8501/6400/KD/1764 2 http:tiwww.knonl ee oon etpztiwww.kuontine.in Toad Ne. of Page 3 BT-S/D11 : 770) CSE-301 : Design & Analysis of Algucitha » » » » a Mavinruns Maks: 100 ese guestion fa Weute ‘Aes ane Ove tion. cto ‘rovide comments co exptvin the alpontiavyaetto-cnds all Dulles qeatons, bebe ee UNET-1 Solve given cxpreesion using recursion tee “Ven) ~ 37 (ds ven" heck your answer using Maslee Theoeeor. Write recuesive algo to find toral number of inode in binary serch tee. Find its complenity to Weile an algo ther, given a sotegers in the range Vuk, pre pravesses its input and dren answers the lyuery shove Bow many of m integers all intg the ronge [0.0] io ( (U7 tine, Your alge should use 1 (xk) preprocessing time, 2 Vehat is toe peobles of prunary clustering & sccondary clustering in hashing? Eaplain. 8 uni 2 Rapluin Torest cetpiessntation of Di aiid describe use of Path-camprension heuristic inaprove ruuing tne of this representation. s 1 com http:tivww.knonline.in ma o) 2 » » » etpztiwww.kuontine.in Explain Motehe Crain Mutupticesion with all Tour steps oF Doynsime Brogrurnming. 2 Foe LCS problein, characterize dhe stewetute of he problem (ie. step 1) and develop its recursive colution 12 Kecall N-yueen peutiem’y bucktacking algo given in Horowit’s book. Assume N..4. draw 2 \rce of alt possible zotution spree and mention, 12 noWefpwine ia cach solution se which Dockuracicing due to unsvecesstil situation gets forved. s UNIT at Let GeV.P) be a weighted divceted gaph with sowce vertex ‘utd Het G be imiishize by INITIALIZE SINGLE SOURCHG.).. Show that if sequence of relaxation steps sete parens Li} 20.4 non-all valve, then G contains negative secight cycle, & Solve using Prim's algocithm the 2iven graph nd neation te al tertoediate sb) geuphs tt (Assume we start from node ‘A’ And pat ite sistance at), 12 http:tivww.knonline.in o7 a8 71 a » a » » » etpztiwww.kuonline.in Whae arc the different criteria that ageds to bo, ‘concemed if we change our problem of Single Sources Stortest pat to Sungle Source Lousece path, Write u preude code for ils new relation ‘scheme. hitp:/hwww kuonline in 8 Gienerate the ‘Suongly comiected carnponents” for the given saph. Mention ull its sins ftom sit 19 the sel oF connecte:l surnponents. (Assume we sae: tous ede oN 12 q Ne — “onrt = Yn a Aow newwork G = (V1) with souree 9 and the sank f, prove thatthe value ofa flow f isthe total Mew into the sink, Compute the depth of s Zonnpm odd-even merging network, Compete is size Piave that ey sorting aetwork oo wi depth ac leaee gn, r6r6=! Write and explain Furd-Flukerson Method tor solving the maximum flow probleun Write shor on merging network, 1248520 2 2806 httpztivww.knonline.in Rae 8501 DESIGN AND ANALYSIS OFALGONEES ne oloned : 5 hors} Nanay mart: 100 Notes Aten any five questions, selecting at en one ‘qeston fom ech i voit 1.) Weare the properties fbi Ob otin? Deine oon 10 (Define ecureace equation snd expla ow solviagrecunenceequatonssrcdone. 10 2) Deeribe binary searches with es raver pater Give sulle samp wid eating forall teee waves oFnary search ice 10 (4) What doyourmanty Her seach panos? Asaon 0 (-s2m 0. 0 @ 4 0 aw 5 @ «i [as0r @ Unit-2 ‘What is Knapsack problem Using @ dynamic programming approach coupled with the set generation approach, show how to obtain an (0 (2nv2) algorithm for the O/1 knapsack problem. 10 Find an optimal solution to the knapsack instance a 5 (p1. 02,3, .P7) = (10,5, 15,766, 18,3) and (1, 2, W3, .. W7)(2,3, 5.7.1.4, D. 10 ‘What are greedy algorithms ? Explain the O/1 knapsack problem algorithm and Gredéy concept. 10 “Applying the Greedy strategy find the solution for ‘optimal storage on tapes problem instance n= 3, (11, 12,13) = G, 10, 3), hp huonlinesin 10 Units Whats travelling salesperson problem? 10 ‘What do you mean by multistage graphs? What is raph cloning ? a () Whatis spanning twee ?Giveanexample, 8 Gi) What is Hamiltonian problem ? Explain with an example using backtracking, 2 (What are flow nevworks ? Explain their use in brie 10 (Gi) Explain the bitoni sorting nerwork 10 Write short notes on (@) Comparison network 10 (©) Merging network 10 etpztiwww.kuontine.in RollNe. Printed Pages 2 prsipas DESIGN AND ANALYSIS OF ALGORITHMS Paper-CSE-301 Time allowed $ hours} {Masionum marks: 100 Note Avemps ive question nal sletng atleast one qution Frown ech nie 1. a) Descrteanslgrithm to each of PUSH POP, AddQ. ree. 0 ©) Whatae Hash Tbles Exp theicaplcations wih 2%) What do you mean by a Binuy Seach Tree Wee sind explain elgontm for Deletion Irom = Binary Seoch ts ° (0) What ae recumences ? Expin any two methods 19 {plerecurences, : 2 @_Baplain following wim example ses (© Pynamic Programming Gi) Divide nd Conquer (0) Describe Task Scheduling Problem intel, 30 [= (Tum over http:tivww.knonline.in etpztiwww.kuontine.in 2 DDesente an alganit for Longest Common Sabsouence (C5) problem and determine an LES beeen fll so gan sequences X ond X#(AB.D.EBA.C) Ye(BABED.BC) 2» Unit Dest the system of Difference Contains, Bebe ‘nousblepinvoled insnving he Diterence Contain Tost0 Discuse Bellman Ford Algorits to soe Singl-Pac ‘Shots Path Problem, Also Find the Shores pth i he henph 30 uni (6) ha Commparsom Network with m inp sot atl 2° posible quences fromthe et 0,1} some ho0 Prose tha it sort al sequences of harry naabers Sine 0 ©) Ditlereiote HatrCleanerand hone Somer. 10 (@) _Discusthepropertexof Flow Networks wih suitable examples 0 ©) Stale and Prove Maximum Flow-Miniman Cs There it http:tivww.knonline.in ttpz/iwww.kuonline Ret Non Teeat Pages 03 er-5pp-14 8501 DESIGN & ANALYSIS OF ALGORFTHM c3E01 ‘Time : Thee Hoos} [tiara Marks: 100 [Note : Attenpt Five questions i al, selecting a lest ‘ong quston from each Lint ll questions arty ual marks. Unit 1 (2) What are the diferent rita which sn lgoritrs mast ssf? 3 (e) What do you understand’ by asympcotic notation of an Algorithm ? 5 (©) Weite an algeritho to seach an clement using Binary Seach with tho help of sppropricte example and determine its complexity: 2 J Quick Sort algortim to tort the fllowing ‘elements: 20 $0 70 1 30 50 60 sed also dctcmiae it time complenity, 20 (0p vaso Pro. ttp:iwww.knonli ttp:iiwww.kuontine. nie 1 3. (@)_ Discuss some of the goneral properties of Greedy Metbots 5 o) Write on algorithoy uting. dynamic programming, to solve tke peoblem of marx ‘chain multiplication. Also analyze the Sigorthats ime and space complexity. 1S 4. (@) What are Huffman codes * Explain in Grief Disewss vatious steps involved in Hulse algnnithn. 20 (0) Write a short note on Task Scheduling Problem. 10 ‘Unit mt 5. Explain with the help of an example 10 find the ‘minimum spanning toc asing Peis meted on the graph as under = 2 http:tiwww.knonl ttpz/iwww.kuonline Unit 1v 6 (2). Describe the Kruskal algoitim to find the ‘minimus spanning tuee. Analyee ite ime complexity, © (©) Explain Difksra's algorithm to sind the honest path, 0 7. Discuss the following (2) Ford Fulkerson Method 0 (©) Bionis Semting Netvork 10 8 Wet short notes cn any to of the following (2) Comparison network (©) The Zero-one principle (©) Mesging serwork. 210-20 (07 Lot 2 p30 ttp:iwww.knonli BoINO, onsen ea er) [35115 BES/D-17 DESIGN AND ANALYSIS OF ALGORITHMS Paper-CSE-305N ‘Time clowed :3 hous} [Masinwom marks: 75 [Notes Atempt fire questions in all selecting atleast one ‘Guesin from each rt. AU! questions carry equal mari niet 1. (@)_ What do you mean by algoritn? How to analyze the comple ofenalgitn? Exinwingsaitableenampls (0) Whatisreearencerlaon? How doesithepin ding the complet of programs? How'o solverecurence relation ‘wsingrocarsiontee method? Explain. 2. WhatisDivideend Conquet?Bepainmesgesortnd is anayss tsingastble ample. Unie 13. (@) Whatis dynamic programming? Explain mati chain nulipication problem ad its solution using dynamic progmmningusinguinblecxample, (0) Whatisereedy method? "Doesitalvaysretum eopimized ction forever problem” Explin 4. What is « Backiracking technique? Solve Graph-coloring problem sing berkacking pcblem ndalowwalyante sli complex etpztiwww.kuontine.in @ 4.) Witdyoumny gehen Diese teen mmstneio ing istlesrcies (€) Wado yon edt Minn peg ee pink vaio SaaS ey eh semgeesieecetp 6 Whatcha ager Eine itn fatter ve nto te a 7.) Wexdoyonsiesin’y Competes? plan Fan NP cass vanlecues (Wate scawnace linen eine etme oegiatow nn emnewn 8 Wie deteeon Sling (© Seago ) Merszuees etpztiwww.kuontine.in etpztiwww.kuontine.in 5007] @ rsp {eesti tnntye DESIGN AND ANALYSIS OF ALGORITIMS. Paper-CSE-801 “ie elle: 3 hws} (sac ars 100 5) apo plo song of ph. Wit 08 ote Atop, guetin n al,ocga one ‘eden y end onatedeponct s (pen eh qty ean reb"Bolacningaictecangle ‘et ©) Whtnscomaaty Minune nts ininumspanig moh pa 1.) What do ou vd by reg on of expng egthew Dos ia geet oun neing nee? (0) acannon _seconrey ofr Howtscvecanense ssnsargiacintassnntod an «Mua ntineeet* tytn nee | 2 Wha spony qc Sty srs (ag) lpi de epee tee ning inte sntntnens, pee aie Be aaa A) Whasjuncpoganning Hote ex x pe Dien Coogan” ve some vals ot are a cs 0) thin adeaoepotoneng sites , ¥=

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy