(apetien (@)A proved forsoving 2 ben (Amare maenaeal protien (@) None tse 2 What ie data stuctare? (DA posammingngunge 0) Acolton taste | {A py tore and egies | (@ Agpeofcompuerhawar- roy 1 The daa strato required to obeck whether an expression (@queve Sack (Ter (Arey 44 Which of thé folowing Fe fncorrect? Algorithms can be represented GAs porens| (6) As fiw chars (Arne (@) As preatcoves. 5 Whose be consderd when designing an alors? | (Is tare sed eo (nthe rare is asd corey | (Gtr is moe ten ne yt sole te problem (@)Allofthese recone. 6 Am lgorithn canbe represented dhrounh (Flow chats (bed codes {© lassion in common langoge @ Alor wes ame) | 1. hore are tw algorithms suppose A takes 1.4 itiseonds Bates 09 milisconds, which one of them setter cose ‘hoe things the same? (@)Ale beter ban B {© Bath are egal got 8, Amarth which tres all the possi ‘Ststctry i and general consuming (Bre force (0) Divide and conquer (© Dynamic programming grits (@Noneof tse 9, Tomain measures ofthe efficiency ofa gorithm a (c) Tie and pace complexity 0 ata and pace : {e)Pcesor and memory (d)Compleiy ae ears 1. Amalgam | As. ame) | (@)Bisbeter ban A Ane) Yeah Semet-¥ Computer Skee OMR) # 3 voided ( ste eas at ‘ ; (wom wow fern) (vem, Amo) ht etic dt et com Qian hee (ow meron Bow (orbnm, ‘Te campleaty onary earch alert (oom ‘®)Otoen Gov owbe am) ‘Wich the ftoning fnctos provides the men Sop cooper? pm =n fe)» Gpmznboen m= 7m ‘Thecomplesy of merge sot seit om ‘Doreen ou Gombe {@empam AmiysCnst @) Pogan Agron Case (G)Probiam Accra Cote (Probl Als Char Ans) ‘at doc the sig asa coun (2) Too. of ite nd he operons le equi (2) Toe of ines eure by he progam (©) Teo of srods qed by te propia wesc {0 None of ve "The yor cae compet for iertion sort wow ‘oben om) (onbem 9, The compe of Fiona seis: «oan (oer) sow) (@)Oureg. Amie)= (Prete median te aray (Phase nai cloner (© Prot se mide cleat (None be ave 21 fr an algorithm de complesty is gren by OU ey comply wi be ee (eonsan © Que {© Expecntal (@ Nowe of te Ame 22 Woche efwing sorting lors te ase? (Mages Quik soe {tern st {a Stata 23 Quik sot lows Divide ad Cane ste. tee (Fake. 2, Example of O() aeons are (matnying wo nates () asing ome vale sie {© Dupin sane carom cone (ateroere 25. ThelPO wandfor: inp ogrrnng open Clpsrorameingcont — | {@ lnpa eyeing ops. 2 Wich oe ong mtd he mot ete rng (Fistelenen Ce (G Metin are pacing (@ Random clement 27, Quek sor wes Join operation rater than erg operation. amo) ame) (Tue Toya "an 28 Quek Sortisa (Doredy sort Divide and ong seri (6 Dynamic programing agri (@ Backching algo. ! 129, Which of the flloning ia sadvantage of Hine search? Ame) (a) Regis mce space ie (0 rete tine competes compared tater serchn sects (Note wundenund (2) Noceary toimpenest. AB] ‘Mk Which algorithm i wed in the op re data strata! (a) Backaacking (@) Divide and Conner wl * (@ Grey, Ans (Branch I fhe eign rhs (Oe etree (okra sty (a) Hunan Caing Oke x fetal (0m Spi To An (2 Aig tows win gh aes n {© Revenge {© Amin eso tow su Cet cain ww meme Am) Et rt a Wh you she ne art vote ‘nh spree fe he rang Fare ot ving sa te sige dco pina Ge ii Ans) 3% Disa’ Alpritin he prin tamper: (9) Dyeanc programing” () ec aching nq Eimeria” Ors aim An (2) Greasy again) Bahai sank (© Dive and one lgin (Brae ce sgn, as 2. Fracona pac problems ako bnown a (401 bp pom 1) Costus pc able (Dive knpeck poten 3% Fractal knapsack problem sled met fat the ooving seri (Dive ndeongier )Dynenicprograing {© Grey alprtn_(U)Bacracng roe 59, What ithe obj of te kpc pele? (0)To gets lalate kash ()Togetmminun weight a be kpc (@)To get minim weigh ine apace Ansaol 6 + Sanjay Question Bank 1 Borage Geen eed oOo eat mia al coe or « rate] -n ena ain rat ne Seales tn women pear Go oP nna Eee cetera aes eee omer eee ikl afte aaa Eiraeceeaitnceet a os Rept ma Rewenceeaeemerar i rn =f agers Seeman i tam ccc oe eee tac Et recs Seen Otome os Sttatrn om rena ee sma shoud be solve ws (b) Binary seach {OLonges common subaxuen:e (@ Quiksor. She einen wa of try Bae ind» (3) Ofcatos tt pees compusin (©) Operant she fry eo (10ers rat slinging artis poe eo ie ae pricey one Porn alerts amo) Which ofthe following are characteristics of an algorithm? °‘cy atgiti erminte e te namber fags (atorowe seeesert Corer ace anne cutsnigann Me) 6 ee aime met enn pedo) One {a Best case (Average case | Se aay Mo ONE malty es eee ad oe a ee ae | @ocrmms Aisen. ‘Ans. ©) Big-Oh Nowtios ‘Gd Allof these. Ate) | (60, An algorithm should have.....well-defined outputs, ®) oo, Worst Case indicates maximem time required for Program ao a ee a | qsetee Sere Ama] (canbe secre {Como sy vm | OTE aero enc tll g, BENE estat eget Ga fae sie) Oe Aes mon To otere! | erat mtn, Si | ae oe |" Seeaataenoe | ame UOneestoee tml encanta el earnest ofan alain To es the canning ay Tera wy wep tee mad of Te tata ee rarer] 7 Sr gene sna rae = ote om re cacnie | Seem Amel (canbe yeserno Caney. anil) 74 SQ nt i he arma 0 expen 8 ot a ues] Het aie” — eee gat ow 2 } ois re o> ws Ams i] 95, Asymptotic analysis Is... bomnd. accept ote aoa rise) scr)” APS vt : Soneri: oe os = (Feed pat 9 Vane net | x Se oe Spec taiae sm) Oe gee Necro, AM (oa a mig te metal), mgt ‘Sinaontaming ite reine proms | latent) (Per can ey we eee | tet ae snarl of an azote. “count = count + (6) Woesease (Gh Bemeae er ae sd wot 8 Ans(Tenn (yh) 09) 0) {9 Tea’a* Gognog (Sages nme knw, See ctr ‘ | | Fee cau, lt tionaine aug] PM ilinkoudaarinns atin sunnt” Cannstatt marina Med) ek wou (ose tn see | Beton Seem’ amy | cetyl Becta Canaanite ewieic bined Comer agaitns | Suey ney aa olen 1 Sas Teoma a oot 8. en the approach towed a toa Wa anal 0? om (mcmama lod intr aitn| 9% Reka encins MMi f the flowing Incase Ngee cn | Tang Omanntr fa) erige sates“ GAs programe wasn Be ‘oon argu (gree fae @ oom, ine 15, What shal be comidret hon conne erage] 78 Blea tenes eemAo itataacsene Sey ee a) (0) Iie hardware wed corey Lt tou Am) {Gitaet amram one wuy tee polen 2 Epona 84, Which of the following data stractres Dest sua tr] 7, ator (oon am) Oe est cae eerie sexs aaa ime] Sets ee 4, Wiha he owing yan proeanming pb? mn OReree Am tangs mon eee {0 Biy seh A OB, epraah tinea Amo | Meahmmnmdn ea The i ain or 2) = Sg > ter or oe © ei tenon gs Om aan | | atm eee 17, The big Omens notation fr) 23024948 2. Whatcan eel ting iit’ ea we ae amo] * Goninon oa cain se ihgomanten be payeSeaaneote harks | ran ant a rareteperersc on OF ayn amit alam an ceouoson pa smo) (nboenec compa at | omen moe Som ore 1 rect coi mr rt | 4. Wich tte toning ta aban of opined) oo | nostic arin geninccetacctenetiag) Oe ont Amo fas navata cn lcm), Whe ip inp eee ae oo Sones | eae ees oe on) (aontgo, ano | « Iepraamtar=(.260) anemia yi) ane ceo Sey Hon mat rn Sneath tenet cg rt | oe 2 | ene Sone ae 1 a ing) Staltehinveemmrisadtrmrinemer ont — | «What bot cae oes impn) eee reais vn ) Sen Orie am | Boxee omen 1» Sn teeta en mi Geo tow. ame)” Gomes rt | 1 Tedienamy kar otiagsh baie diosa) O)emen | otras). Ain Sy shinier? Direeergeon bm pen oe 2 | QRptoeknm atimencyrse Amo @ pe ‘Ams.ih) 21, Choose the incorrect statement sbout merge sort from 1 Wife tng attri stint “| Cy (Bateson (2) Merges ing o. Wha efile sb org ett uses Onesie Speier ons nen rs 10, Woh the owing iso on pe stg lt | 2 wi fe wing pl erin 7 See Bien ama) ieee waa | nn Wathen oving nt Son ap ae (Oiownen Aa (cnt ite zx Sn tig nt sn rigs | Oa oa aad] wasn Senne Siteeg doit te Oe er 1A Which ofthe lowing tab etn grits take th st Clete elise ric ote rng a ei Gente Gwtepree am ‘omen Le an easton) Sea eee pete yon as Sapo pee rar Qdnucanicner (6) Dytamiepopmning, Atha) (The =weet 144 Suny Question 26. Wh of he ving stig gre ma eo (Bogor -, hpne nrg srt hae st me complet 8 tnd (a) Queso Fae | = 28, Which of efolowing sorting algoritim des no se nit] (a Queso (Hep (@)Bonam up meze sor 29. Merger ses whch of the fling slertins open en ae ar) Am 1, What the ular pce omplesiy of standard mere ou 0%) ote) (Ome ‘52, What he pace comply fi place merge sort? ous (0th) aon (otnosm, -an Merge sort ses which of the ftng mtb impne Go Mevis (@ Secon (tsctnsog (6) Bom sundad meg srt nips mrp sr ae sible (6 Sanna mrss ns pete ine come on -t (o) Sen nr thas pot ce comple ani (oy inp mene sot i og sae come 35 place merge sort asa sar (Toe (Fae ans) Ame) ‘How any pases does a eso sort sloth const oft one on. ow am 3 nih oe long oti impleettins iia = ge" ane neem hat srs Wy exchanging act ene Sutera ee ‘ono tonnes smo “ee coming ine fan insertion srt leit he crow otes Gone toot aa mien or ou smo 1 tite nm be on eo ‘me arr se eee in scape ee to prom meio16 » Senay 1A. whch ofthe towing optlon conta the ore ea insertion sort algorithm? ™ (Andee (oy Dependabe Saas signees all 7. Which ofthe allowing sorting algorithms is thefts fr wn imal (Oat (oy tmecionsort | (Osteen (ae sr Rs 48. For the best hte Input he running time of an lasers Sleoritim “3 (tin 9 siy (Ode (eyDepentson inp Ase 1. Which a te aoing example represent the worse Ihean ert sort? “| (a) Army sone onder (0) Amay nated in reves rer (© Normal uneredaray —(@)Largearay. ‘On which algorithms heap sot based on? (a) bac ap (@) Biay ee (©)Prory queve (ont. Ans 1 In what dine can a lane heap be bal | 009 @ON eg) 0(08%) (ow ‘50, Heap rortiafatr than Shell sort. (Tne Fae, ‘a As {53 Conder the following heap after build heap phase. What il luscorresponding aay? ee Amol | \ ©® ©@® 26,53,41,97,58,59.31 | ()2631-41,53 5850.97 Baeattss.97 31 38.59. (097, 33,39, 26 41, 58.31, Ams (| ‘54, In wha poston doe the array fr exp srt contains dat @o on ot (@)Anywtere inthe aay, Ans (0) mel UDimreningsring oer Deen ‘Ghats the pleasing tne hep srt alert? (3000 ones {0th tone Ase) eae aay are resi to perform dlton cperatio is we 3 (4 saeninopetat (ond, ‘ovo iee 0 Borers tone) Amie) Ghote average numberof omparsos wed in aap Ft {FNogx 000) on teg89 -009 onbesn)-! Bake 000) Amit Crete for dst? toon owes (Botees) (0m on Grote average numer of cmp wed fo ap ort ‘andowa prmuinion of cit Hees? DINoEw ON) OzNogN-O08 0g) Ot nae) (8 28 og 8 O08. he lowing rrting norms the ses? (spe fey Gu son (Shimerion (Sell (Guck ot lows Dividend Conger res Tee take ms ‘nat the wort cae ine compleniy of quick et abet? (on, ‘ons’ oo) (otes™, Amie) poe ce ttawing methods the most ctv fr NE {he prt dome? (a biteenen ()Lacenent eerie paring) Random cement ARC) i enent tom the given np wing median free prtoing eto GST Ane) wr 618 © Sanjay: eeeaeee 67, Wiha td chose men Co) Cong rn cnet pe CS comang Se steep (©\cmaing a Seen spe (@ aan see parr eo 6, Whats te vere running tine oa auc rag tore) 00) a! Gomtee (9.08% i 6. We twig stig sts ae a (rites tet rr? (seg a (Sirs (Sells {Babble sort aay 18. How many sub arrays dacs the ick sort algorithm dv tire array nto? (3) One TW ©The (@) Fou An "7 How many comparisons will be mad to sort the array ac 3, 8,2) wing bucket sort? os er 99 wo. 72, What the alternate name of bucket sort? (3) Groop sort (Redirect ©) Binsow {@)Usorm sa. ans 7A, Which of the following non-comparizon sort can ale considered as comparion bared ort? (@) Courdng sn 10) MSD adn soe (© Bostet son (@) Pgcosote son 74, Which of the folowing fe not treabout bocket srt? (a) is anon comparison bared ieger sot (thea dito ot (6 Itcan ao be comidered a comparison based sort (2) esin lace sorting ago 15, Which of the following don’ (a) Algeciti implemented fo soring individual Bakes (0) Number of behets wad (© Disuibadon of input (2) apt val 76, Bucket sor is most efficent in the ace when (a) The inputs nn uorty dato (6) The inputs randomly dsb () Depa anges arg. lect hee complexity of ac. (Tir Yueh Sometr-V, Computer Scence(OMR) # 19 178 What I he worst cae te complesity of bucket sort amber ef bacets omen mone oom) (aotngm, amie) 179. What the best time comply of bk sort = mumbo ack? ome ome (om) ote. bn) sn, Which of the following le nt necessarily stable sorting Mert | (Mepesen 1, What the wort spect a ct @om+h woinn 0%) (@ovlog. 2. Which te allowing the dsb ot? (a) Heaps Smid {@Quiekson (isdadneon Ame) What she wort aed complet of LSD eo sort? (04m oe) Om) on) (Orn {LSD radi port egies. pases tort ements tag ®) CD Novos (© (log 00) {a (ohiog 55, Which of te allowing i fa? I DUSD aso ean epson esrb (O)1sD adeeb conprion gli (tsb ain ais aro {LSD a wr wes acketo. “ ‘4, Whi oe fling ring agri tbe (a Hespsor To) Seeoa sot Stop MsD dase (LSD are 7. Woh the fllorng sould Be wed sort as ‘ae enh key el? (imerionson | {tSDeadn son ()Couningsee (a) Pigeons. pei ot acht art = nombre amo) ey Meresst (a Queksor Amie)———a {38 Which of the ftoing a combination (Fortndicion —— ) Somaya (Trebserndisot ——(d Fashsert 9. Which fhe owing i tre fr the LSD radi nt (0) Werks et fr able eng sings (0 Aesesesmemeey nny (Sore einen eh nd a ‘5 How many comparions wil be made to sor ay! (08.3821 aig cunt sot? 5 @s 07 es a 91 Wate torn estan example oon compared (Batten (©) coving srt (0 Rat (Bucieton aay 9% Which ofthe ftoming org echniees mot fie ate of input daa wt sigan greater tas ac ‘ements obese? (a) Seton st (0) Btb sot (© Cowen xt (@ meron wo 27% What the usar space resent of coun sr? wou 0m) J ©oto¢» (0+ forage of ings. An 2. Which othe ateving sorting techalqer is aabet (0 Qiks (Canta so (©tteap st (@)Seecen as 95. Wh ofthe falowing ue the ages of usta (2 B4bbeson (©) Coating ot (0 Qickeon (esp o ‘9% What the averape tine cmpley of counting sort? 0m) (Otago pat ow (OeI6¢m, ne 77. The comply of which of the fllowing sorting agen remains oe the sume tbs average abd morse (0) Quick son (6 Insertion so (©) Cooming sot (@ rome ver ek og ral 1S ag ane a Wtf ning | (© Coming etna rig ce Ana 108, Watt atta of coming set sieneatt once geet? eam tn OE nt Peart actrees. Ans(Question Hank 106, Which one of he allowing i fae? (Heap sot isan ips igor (by Hep sot as Of fogm average casei compeiy (e)Hepsrcis sable sor (@ Heap sot comparison asd sri lgarith, ‘The descending heap property is G)APacat)= AN (8 APaeM(O) <= At) (Arent) >= Al] (@) Arent] >2 A. ‘What sis worst ase te compen of Heap sort? (0% gm) @MOUr le 0%) (0%. Amid ‘Whe tthe owing sorting ager is ou consent (@) Section sot () Queso } (© laseion sort (Heap sot aa Whereis ina searching wed? (2) When hit as ot few lees (©) When performing single serch na node it (@) When he thas ot few elements and when perfeming inp seach oa onde it. im 2 What the eat cae for incr sare? (Ot ben (©) O0en) 0m) wow. 2 Wa he wort ate for Hea search? (Oreo) ©) 0008") (0m jon. ‘What the bet ete nd wort ease comple fod serch Forming. 00988) O00»), Of gm) (0m,00) (on. 0%, 5 Wc te faring dsndvantae fina search? ()Reqares moe mace (Gee ces cero te sig ite {ethers any difrence Inthe sped of execaion betwee nea stench cursive) near search trae)? (Gitah exe tame speed (2) Liner search Gears) taster _ Ba. (Tied Yan Srmester-¥, Compute Snes (OM) 23 (ones see lee) er (8) Camber hae (0 Isthe pce consumed by the incr arch ecu) ea sear trav same? (2) Ne. recs spt cneumer oe ac (0) No. mcs alpitin eames ce ore (@Natingenbenis Am) What isthe worst case reste of nar search (eos) arith (om (© 002609 (om (90% sow) Linear ware cra) lr ede (b) When ee othe dae are (Never wd oo) "Th array rafal: 1,2,3 6, 18 At what inet deme ‘totund? (ying ear ere eurse) alg) | (oat (ese (eet (stat amin ‘Th ry ait. 23 64 1G le te 1 ‘men? (ying near search ears agra) (7a (sea (17a (i) The fitin cas ete umteroftines. Ans) ‘What ie the Dest cae rantine of Hinear war (cust) ‘Tpit anode set eens? ou ‘ow , ote (on. ed am tnar earch recursive abort ad Minar ee fear be permed oe moe A (omy vache eon) Lerch canbe ert (tear fotmnne eoatinne (ormene Ansiof ecriveapproaeh than an 1s What te avant if wea Tome eee iter ateny mint (Gstectn te te. as se Shnnan peers (79% 9 Re = 8995 What 3 ‘os, aml 11 Gren an aey a= 4,788, 9 9498, 10) ade 99 Sir cm as tependng ayement) i Eetan cad west rei oma rsa Some (ond 1 Was be wort eave empty of bina Ans search sig 0008) oe. Ane.) 19, What she average cs tie complet of binary seach sa ‘some @0%%6m) 10%) (ow, Ans. 2 Woicht he aowing not an aptation of binary serch? (Toile owes und n nord gence (© Deming (Tose n ward 2, Bir Search an becategoried into whch fhe ow (Boe Fre cigs (Die econ ©.) sgsitn” ) Dranicpopumning Ans. 2. Gin an arya = (56,7788 9) ad ey 8 ra roe ate ewan” Hew ma o on ae or Ane ing? (90504106 (34an499, % a Computer Science (MR) ¢ ot binary search wih tration? toot oer (oor) (90m (ao. (eo the cases uniform inary Bury search? sana oem Sc lackupis ener faster than a ition nd hi cpm me © AS tn nso ne ick a (0 Sin sete oe rt ota rey an ambe of lemen Se cen eae oar oat ae Sh tie te compa enter inary ch? Dorr ‘Sone em Bork ie 0,3 679,380 119) ona Moc ety ey comartn ae mae ede te compan co oiudueeerna an or os os oe Mow amp Schengen? (obama bom ace Stefan vie, thee eps Soman (aay el te Shot tong ha mp Search Pieler yeeros (chs jmp ty anni en (Oemp seach sare fom ene Oe : Sine ce eu pciel indes m8 Ans) search fie compared 10 Ane) Ane.) Ans.) ‘Wc othe towing searching algorithm fastest? (0) Samp seach (©) Binary search (Besteue (Avengecae (@Nalleae,Stereo ac mst Geoathon 5c com omit frveetenio) t econmaty iei2bjeinien ‘ nd } Jona is 0) se Shans oH me (Sanam ome ony San tanion ON ho pee 2 What tine comply alwing ee? mevsbreney t bevenuoar i ; 1 Ions = GON =sna) ONS NS 2 The ue cin rh (ian semetaeiebemseer tee hice sme mya (Ser rectus dene te ray {Sen ictecene e ri ant ee a. 27 Mat ie ey tang da ferttansicemsi ‘ foray coms t am. o| eon a) , , ‘sous 0% op (Ow Dee, sience(OMR) #77 a when we say that an algorithm X Is * pote Seta ea sti Ep beten: choice for large imps Oa rane ecto » aa ano oes Sette wa team ea i f 1 2 emi ret nas emcee etm ee tain tne my nb On nas ae Tem ‘tant Cope Gaeie amis 48 The rams sored by batsman in SODI ae 31, 97,112, 68 and 12 The standard deviation er (29 1 Big 0 notation is 2309 (@267. Ans. (6) ‘44 Fn the mode of he cl receved on 7 conceive days 1,13 13,17, 19,2538, an ws or a2. ‘ane ) 45 Find the median ofthe call recived on 7 conietive days 1113, 17.13,28 28,18. ors os (on. Ans)=——<—<€_ 7 ~— bers 1,7, peian of te 9 consecut “i find emo and pena Tt oF ors we os. Ans a t ee, smn 1m wat te median ofthe] STE am hn te mean 4 mar 1 Sen (en. ane oping sarin? sh {Pinte mean of Pion dbstibaton, ten the variance een om ty ce (02 amet Bee ox “ fixing ject 08 ind te variance, or ox Ans 0) ee ‘9. Sind the arte mean ofthe tof data 61,5 8a 10 wan oo aa] ae os ’ ou es ‘a7 anso (Oty haan tet aopped fam a certain ei telat the geomet meat i ae gps] Ene eee meas ‘Beep id i ean ad ain ©3 (a4 Ans (o) caver esis (1 Fn he variance othe ven data set 3,955,657. see ore rascal ot 2 Pn he mean tong oi 3 4 Ameo) ™ a (Find the va fin Plon's distribution the probably of ot oe hn of tintin aed na ts 1 when 8 sn eth oat actemsit or @3 we oan am on anki mean of random arable i given by equation fs ot ana} (ED ma 52, BX) =A for wih drat ee ion EE None of he ama (ami canton) Pou dition | 6. Poison aban apple for ° ia dan apse mo} ramen Ct i mene (© Dire random arable _(@) neglarrandom val, Ans wo one le, Ans) x ai A a (0 hens tntn ent 5 Wht tee et Siena? ee 28 (Adar soir eb ote ejects oar pen, sim area mts sine A Ara so ta ct, wo Omen, = Dinter] (123) 6.100) «205 Pots’ ima} teu) = 11234; N0/-AR5 aPsane' dsrbatonfod te leat men | How eyotiatntueamany ein AM aah instante an array in Java? oan » (ona a8 bebe (pia sew)” tet Ans. sew int}; DintanO = new int, Am)roving the cortect way 10 delay ‘Lich of ae ftlowig mains 2% a a (ial a gate tong eae? le ass) poe tol miei a sther= (12345), System our Sytem ent , 1 (sands (Sand (oume (td? «tthe uit telling Ja code? icc ry C ne pees al aii ID ‘ wager .234si Son tn ) : tos os (Amnon (Omega am 2. Wen dot Ara laetO sO omni ce? eompicane )Rensne Onamene (@emecepionstal, Ans. 4 Wier wings mule ene we ay (inte (Seeing foes (cane (spat ey 9. Matar antag aera? (Ob of malas pesca ed ees rad say cae (es teen fay (4) Easier to store elements 2 teense ape ans Ans Wht are the dadamags of 10 sce he gue cnc comet esmptenene tae cnc af wang of memory sce eet (© eared in an ary are lester than the allocated sie (gy non val of aaa canbe neste (Element ar sequemly aces. Ans) 1 aman ito ayes, what he sa of nae. ors 1 ju (ooo. Am) 12 tn genceah the index te fst ere wo 1 2 @ Ansa) 1, Hlements na array are aecessed = (Randomly “) Seqoeaally (© Exponetaly (6 Logarta. ns) 14 What ea bit array? {apt strc fr repeseting aay of rsords {b) Dataset hat compact stores Bs (2) nasiray inch pat of the elements ave the me vale (Gy Ara in which elements re nt preset in continuus latins ‘ans 0) 15, Which of the following bitwise operations will you use 10 set a parila Bt to 1? @or ann OxOR (@NOR ans) 16, Which of the follwing bitwise operations will you use {0 et & parila B00? Gor ann (@Xx0R (@NAND. Ans. (6) 17, Which ofthe following bitwise operatons wil you use to toggle ® particular bi {OR wa (@x0R Nano Amo 18, Which ot futoving sno on ventas i ary? {o Expo tied pela fe ©) Moira of daca 19 Getter mpi te eer ln rine (@ ‘econ nv emesis ‘witht fooring nots adreniog obi avay? (0 "Wine oman ey mip cons ee (© Acuna br expen . ans (@)sc. (The Your Ss So Tne pmo fea ed bythe dynamic area coments “ayer ay th hie oy cm aoe (a) Physica ine Capacity Sencar teat ee etait oO ome a yw wl Jement dynamic arrays in Java? = tcations of bit arrays? ‘30, How will you lwp ar tame ine a wse wo ie arent (©) HashMap (a Lis. WYisty einer = ot st amg St ioe gen os i om hemline Breer oS a SA atoving bei operator i x ern vient pats im a Wont ‘Geometric Array Wevclesbitara? (ides AmayTree goxor (wai rio es Spe A. 1, Sy aowing es advantage of dnamlc a9? Dhtoxattyotetecre (Dan cxce lane 1 Sh os tamning whopalaton count mea 8 ome ey 4 What te Ngiingot meee? ‘aor wes {Pate ie omer a inary Re eet Sea ies ey | Bete en smo) rat ute am] oe SOU! ae tad x Latent riven ee cea ence am ered Se eee me cima a ri ct aes, Open ent mi vy pee ec bie oe os ome no Becta tees aes Bee ed ioraatontn easing nee tics ineace eect tee terre sean Seat See ey Shee mn Roaauriviioo (@ Thesizevisblets uses — @2 0. Ams. (b)‘question Bank emit than the suse annette 4 (oT based stinger wd const he erg = : oe mtn ce ine i Calas nna pe 6 sea rs | a ag te ro erate ees acer a teat aut pest Nate as (63, What the elton beeren Spars and Density of mtr? (a) Spas =1—Densiy (0) Spry 1» Deny (6) Spay = Density * Tu umber of elements (Osun aDoaiytenmiectemme Aa 4 Wevsed et pre a? (Ditonto Speer Gwenn (@armrcayly, Ane 6 Ot te Wot ae Tne Cons fr ation st Senn ore orate ne (66. The matrix contains m rows and n columns. . _ Ben hms, The matic (itor deena {() Total number of Zero elersen eee (9 Tul acne (Tolmer cen Ane @ 8 1% m. nae, (hed Your, Semester, Compa “nich of the following wot the method to represent Sparse Matrst To Dietonay of Keys () Linked List (ary (@ Heap a @) {eps Mats alo known as Dense Matix? @twe (oy Fae Ans) ‘Pai ne of he allowing ia Spec Sparse Matec? (Band Matric (Skew Marie (Nal mats {@ Unit max Ans () ‘nay the Symmetry Sparse Matrix can be stored ‘telly? (ayneap (Bln wee (Has ble (adjacency List What des the mune of iversions nan array indicate’ (@) Mea vile a the elements of aay (0) Measure fowls far th ray is rin lng sort (6) The diritton of values inthe aay (@) Maan vale ofthe elements of ama. able, also called as Ans (0) cariable, I one that is eter variable in cor. (a) Channing (@) Dynamic (sate (@) Sear. ans) We sou group gether reed aa the sop etre wamy wis (@)Relavon (@) arabe prop. Using aay ina program is eficient Because (@)eetonens program () The program compe fase (6 Number of vaishles are reduced (@) Danis sce ater Anse) Data an array can be distinguished using... he. (@Reteence (@)Subserpt (amy @D. Ans array isof tring type al values are..by fat (@)aut (Nall @o (@) Nowing Ane ‘The act of ining array faced as: (@)Popuiatinganaray (6) Assigning aay (© lniaiing (@) Factoring sed sry. As.)“78, What the valve offen in t (Sac keyword ising (©) Ary clement sould be intiaed sing singe quotes {c) Ara elements shoud be in square brackets the following Visua! See im Jen As Integer (o) Square £8) Transpose of, £ fore ainy ne ene ie gy ae ae png] OUT Mahowts dane Se : ee mae 6) Gate Mersin (@) Arthur Cayl «> represents the highes, aa ey. Letty hewmen tame Ms), ont etapa MA onic aoe Olam Amy a geet” Mg inate onal eo waseneemiet et see ba $9. A program P reads in S00 integers io the representing the scores of 500 students. It then ‘ris the Arequency af each score above S0. What would be the bet wy {orto store the frequencies? semen el ne ‘Ans (6)| (@)Anaayof numbers (0) An arayof 100 mutes 11, Whats the rel the lowing statesients? (GA cynamicaly aca ‘aciie) AS Sting = ("Bombay "Chen, “Ladsbh,/ (0) Adjnamialy allocated sry of SO number.” Am) Dee eC ‘As String = ("Bombay” (90. Which of these best describes an array? a | GA daa secure tt sows heal ever (2) Conpistion Emax (Runtime Eiroe fo Rommel ten of ane oom, 1 eC ary is (Bombay, “Laat, “Koa Tamil| (Coane of oe of med pes Ans.) Nadu") der an " ee poncho, “Gimat teaser 91, Consider an array A(20, 10) assume 4 words per memory cil hy amy (Bombay, “Chena Zana ‘the base address of array A is 100, What the address of a aa A(T, 57 Assume row major storage. (Mat rami 360 oss (Namie mpd metro oe ‘att oe - ‘of columns multiplied number of rows 2 ‘isthe 04 1 fallon were of code? (Naber map nant eg mibiccas ey ag Nimberofcls mild wnberofcomns. ansin)| {How Sou acta mar aga sing pointer C2 Publi static void main(String ars) ; ie the number of rows and columns respectively). { 2 far = malloc(M * N * sizeofting); Oar = (12.3495 o in *ar = (int *)malloc(M * N * sizeofting)), frstemoutprintin(ar(sDs a iat a eos DimalloctM +N * sizeoftint)), if it ar = nt *hmalloc(M * N*sieoflan)y, ns (0) y % Mticntgamce ee aml] os In sovng linear equations (b) Image pe (©) ArraytadexOutOrBoundsExeepion i Image processing — oon (©) Graph theory (soning reste ans (@)tnavlidtnputexception °ttn? sewing wan gaa i Wah PE MUSE MENTHOL Tas once oR oe Sry REAL OFREALS © Ere ad 2 re eS UEANTOTREALY scp mane ene er “ene "stdin meses och (6) Spatial only. an i to Puen et nec of wage of memey spe Tens Sey ciate yi se nr sn ed (©) Irion tase on poston ( Accsing elements specified postions Ans 2 What the tine complet of iaserting at the end indy ares? ony wom) 0006 Fiber) er OH). Ans 4 What ihe ae complety count he number of elements (hetinked it? (ou) Hom (9.0009) (010, “4. What the space compleiy for deleting a inked lst? won, wom (Biter 01) or O19) () OLE. ‘5. Which of hese not an appa of inked list? (a) To implemen file stems (0) Fr separate chaining in hash ables (©) Toimplement nor-bnary wees (@) Random Acces of elemenis| (6 How do you inert am clement atthe bepaning ofthe Uist? (3) publ old insertBepiniNode noe) na ns Ans nose setNexthea ead = nde; nse (Third Yeu, Semeter-¥, C (mentee ead = nde; ode setNetten) , (6) ble engi\ode head) C Int sise= 05 Node car= head, ‘we(cr=al) ( curs eargetNent): ) (@) public int engtiNode bead) ‘ Int sie [Node cur= ea wie(cr!=aul) ‘ cur curgetNext. getNext) 1 x 71. Mow do you insert an clement tthe Belaning a the Ht? (@) ble void inerBepiNode nae) fl ade seextheai ead = noe: ans 0) d (©) publ vod inser i head = nae: ode stNextbead saeess