tie aase cts cemacind comets UPChEn outer ined Oienng ase fyvine Qerrreersrs casos © Ausary cress Jan [escas [mmon Goode Data Structures Algorithms Online Test © Frovious Pape Next Page © PER NISIT ES tis ots srctres algoritune Onine Toot snusos acolo cetistion exams organizing auth ‘You wil be prssried Nut Chace Guestons (Cds) based on Data Structures [Algorithme Concept, whote you wit be gon four pers. You wt sate best susie a answer for ho quoston and hen prcsed fe the net qussion without wasting gen fine = ‘oui get your ene est coe ir nating he competes, 19 OSA- Home ‘otal Questions - 20 0:86:79 Max Tine - 20880 19 OSA Agortins Bases (2 DSA. Rey rte (9 OSA. Cred Agritne ‘= DSA. Dido and Conaer You scored 26.32% Sana EE) Teta Guestons: 19 Aterete: 20, Corect 5, Tne Taken 105 Min 12 O54. Das Saco Ses Minimum umber of spanning Wee in sonnet orp © OSA. Ary Data Sacre An cs = 2 OSA. Ln es = 1 OSA. Dey nt a 1 OSA. Ceti a it Answer: @ OSA. Expression Parsing Eyre aes {very connect ap tet has on eran es ing Tctnies ‘Sou Anne shell gort uses, 19 DSA- eran Search c-seecten sort 12 DSA. Song Att: 15 DSA- Bubb Sort D-aucrsot Anawee: A (2 0SA- Merge Sat 19054. Stel Sot Explanation 1 0SA-cucksor ‘Sel sat uses inerton sort whon nal values 4 19 OSA. Graph Dats Sears 19 DSA- Depth Fst Tavesat paisa (.-in the deletion operation of max hee, the root i replaced by A pet vale vai nthe le sbs0819 0SA-Brary Seach Tee 12 DSA. Spanang Tee 19 DSA-Dicussin eee 1 UPSOIAS Erans Nowe Etec Resume irs 19 HR erven Questions 1 Conte Sossny (any andom value tam te neap ‘Answer: D Explanation egress of bag min hap or max hap, ets aay replaced by lst bert of he 10 -nane one above answer: Explanation Binary search roe vols a sorted Ist when raversed inode 2 Browse (@-Aqueue dsta-sructure can be used for | exrsson parsing Answer: Explanation ‘Gunso canbe ved or ted resource slain Forcier opssons, stacks ate ud, Bown (.-Program with highestruntime complenty fe (AS Towarof Hari | BSbonact ST] (Pre Nunber Snes None ofthe ave answer Explanation “Towor otha has the highestun ine comply & Browse (-Postx expression |sjust a reverse of prefix expressionAnswer: 8 Explanation xpression notations are not evr (os) ofeach oe, rather eperaors used inthe ‘rpestion nave dent arangamants {= Which of the Below given sorting techniques has highest best.case runtime complet = -iescton sont 10 -bibie sot Anawer: 8 Explanation election srt best cae me complet & O40?) (inex ot araya in © programming langeuge starts om = 0 -vndeinnd Answer: A Explanation ‘ray, 6, stars om O whichis mapped ts aso adios 8 Show Anse 2. nterpoation search i an improved variant of binary search, Is necessary for this sereh algo to werk that =~ ‘Asi clean snouts Den Sore om at easy aNDUEG Bala Cotachon sou be Sod mans Bu ot equaly sb (C-datacolecton should be aqualy dtd ut aot sata None ofthe ave Answer A Explanation For this loi to work prepay he data colon shuld ba in ote orm and ey ‘Sow Anse © - Winch of he folowing algorithm cannot be desiged without recursion = Tower HaeAnswer: D Explanation vor prblom which canbe solve sing recursion can aso be sled sing rations, Sow Ane {In conversion fom prefix to postfix using stack data-strcture, f operators and ‘operands are pushed and popped exact ence, then the unstine complet e~ A-on) ‘BEOHE O09 0) 9-a4n%) Answer: 8 Explanation Inte post conversion using sack wl have run to compo of On). ‘Si Te folowing formula wl proce | -Aumstona Number Answer: 8 Explanation Fonacc Series generates sibsoqont number by acing to revs mbes Soni In binary esp, whenever te roots removed then the rightmost elemento at levels replaced bythe oot vny? | toons posse way B= Toake sue ha is compe nay oe | |S tecavse et anion susreeminTbe MBS] Nene oft above Answer: 8 Explanation Abiary nea (whether mak or min} has sats Ie propery of comple inary Lee at fas,so ansee Stack ie ured for A CPURecouc Alcan 8 Bradt Fat Tavera! None ofthe above Answer: ¢ Explanation ecursivo procedres use sacs execute the ost of ast oxouted rocadtal al ‘Sou Anne - Wien ofthe folowing uses memeization? 8 Dude and conquorapreach (0-None ote ovat Answer: © Explanation ‘Remembering the resus of raviousy cated slions scaled meneizaton ow Awe 2 -Re-belncing f AVL tee costs aon) 04m) 2-a4n8) Answer: 8 Explanation ‘AVL tabs have complex of Oem) 8 Show Anew G-inaminneap Bcd nodes hava less vais than parent nedes, (maximum vas contained bye roo ed. Answer: © Explanation Ina min heap, pent nodes store lasso alos than chil nodes The minimum value of{2 -Atar etc iteration in bubble sort, A atlas one elements ats sorted postion. (one es comparson sad nthe nest tera ‘Anawee: A Explanation unsorted ist Hence one ess cmparsen ‘Sow Ane (@-Time complesty of Depth First Traversal fie A-@IMIIED. B-O(NM) c-e4ep b-eavien Explanation seg Depih Fs Search, we aves the whole grap visting al Varies and Edges Bow ane © Previous Pape & Print Page Nowe age © Averisaments & Gaooutus A Temsotuse —TPrnayFeeey Oras = Helpmg G ondet