Usy Tin GBCS SCM L110) 8 \d Applications 3h, ote: 1 nove any FIVE ful queso chong ONE fl question fom each mae 2M! Markes 1: Rls’ te, Cmte ocomes BCS304 ‘Third Semester N.F/N.Tech, Degree Examination, June/July 2024 Max, Marks: 100 s - Module. MIL] Cc aes SSS Brier {pee fete ——— : ot tes 5 eee ae a TF apo ey TO implementation of cireulaf queue operations. ~\Y Ce eel = a a a i) Insert a node at the begi ¢ fi) Deleted node at the front < y Display See oe ea ~ i) sac A tag Dele a nagogt the end ie b a To) L3) Cos singly Inked a Oe “What isa tree? With suitable example, detine 7) La) Cor i) Complete bin ee ato [api ne ay we eta 13/25Fortis given spate mais, pve the ldgammatienked representation, [4 JIS ] COB 20-00 4003 alo 000) R001 H 0060 oR GE [a | Dias How biary es are epost a ‘ary, (Linked Hees | Discuss inorder, peorr, pstorder and elo i ee ee Tove onder traversal with suiable| @ | U2 | COR | Define Threaded inary Tres, Discus li Threade binary THE & [tacos Nodle=t Q7 |e {o perform the following operations on Binary Search Tree] ® | ES | COM (Inserting an element ino BST. Gi)_ Recursive search ofa BST. 1 | Diseust selection Tees wit an example a)a | Explain Transforming a Belt ino a binary eee wih an example a [ta | cow OK ‘GH ] a: | Define graph Show the adjacenoymantx and adjacency lit wepreseniaion | @ [L3 [CO ‘ofthe graph given below (Refer Fig Q8 (a). Ce SS ®. ¥ [ur] co | Explin in detail elementary graph operations @ [ia | cor > Module=5 QI [ae | Whats colision? Was are the methods wo resohe collision? Expan Unear | 7 | L2 | COS ™ | probing with an example. . Ta deal Abou AUS and djramie Hasng «|i [cos = | Discus Leta Tres witha exile 7 aa] cor on Qi [a | Exphindifrent pes oF AST fineton wit camp 12] co | Discuss AVL tee with an example. Write a fancion Tor insrion to an] @ | LS] COS AVL Tree, & | Define Red-black Tree, Splay wee. Discuss the method wo inser am clement] © | 12] COS into Red-Black tree.ws [i Whe Mlelstils | ‘Third Semester B.EJ/B.Tech, Degree Examination, Dec.2023/San.2024 Time: Data Structures and Applications BCS304 3s Max. Marks: 100 Note: 1. Answer any FIVE full questions, choosing ONE ful question from each module, 2M: Marks, L: Bloom's level, CoCourse outcomes Moduie=1 MIE e ‘GH [= | Define Data Siactures. Explain wit pea block schematic UTeeat pe of | 10] L2 [COT da sirutues with examples, What ar the primitive operations that ean Be performed? - [Differentiate Between stucures aid union shown examples fr bath | $1] L| COT © | What do you mean by. paiem maiching? Outline knath, Morris, Pat} $ C2] COT pater matching ago. on Q2 [a | Define sack Give te inplemenauion of Push (). POP (and deplay()] 7, | 12 [ COT functions by considering its empty and fl conditions. 1 | Write an algoriti to evaluate a posnexpresion and apply the same for] 7 | L3 | COT the given postin expression 6 2,/ 3.48.25, & | Writes the Post form ofthe folowing using sack > @} ts | Cor @__AMBYC+D*E) + F (i) tte) Module? 3] | Whar edna fois que isis Wi nplemenaton | # | E2] COR oferta queue b. ‘Wile a note on ruligheieks Maelo 6 | L2| cor [Dein ies DaeTReW EMERGE ng draniTWTIs [6 [ua ]coa : OF ‘QA [a] What ia linked list? Explain the diferent ypes of inked Uns wih neat] 4] LP [COP eae 1: | Goethe snscuredetiiion Tor sgl inked Tat (SLL). WiteaC fnaion | © [LS] COT ®, | Insert on element at the end of SL i) Delete a node atthe beginning of SLL. Jen) Write a C-function 10 add two polynomials show the lnked tt| @ | U3 | Or representation of below wo poynomits Ox)= 3x!*42x" +1 g(x) =8x"*—3x"" + 10x* Module=3 (OE ]s] Wie 3 Cfuncton Tr Te Following operons on Deably Linked Ut] # [ES [COB addition of node concaleration of two DLL. 3. [Write CTnction for te Tolawing operations on crewlar Hake Wa ¥] 13 [eos Insetng at the font of ts {i)_Finding the length of a creuir Hist Torzi ale fe] For given dia aw aay ea ee a T0185, 15,3, 110,30, 7,68 | Titand exp cmon operon af ia Canes [plan abe : 06] 12 [cor ona Bw [Deine raph Ty act rota con estan ts 7 ota icor Mods [93 Ta: [ Deine tah: Papa ppeso i eal Toya [cos Be [Explain sta asia inde Wola [cos z [310] | Wie ash note = 12 [co * orl 12 [cos <. [Priority quewes > (07 12 [Comers TMpPaRTANT Guests. TU ese Gu & Define Data Souchure «leit olde Soudwres ey) Vex featires, MMe agian beice pending. Diffesentiate bloy Stee & Dynamic onemery Hachon? mrmeny ited farcnn iG) Lp pres four dynamic e & Ure NII Urpancea corre gi Beat) “Nop rnereze, > ee ececarmey en co @ Compersinen bles Cieheres %& UNTO, a eS Define @ Steet sapien tre Uy otk operccton i. dik ton fein on Sees ° Austartes © puretany Wy Marmples ete? freien te demented, fe bette actin (en | “ 2° Spee mobrees Cave depridion) = Dslynernrals Whlie defen cam) 5 tp WB om See y om G4 anon3 fig) oe patyee Cover a PVWVWOPeOsoesatisV0 Ns naryome.. t GD ne Queue? Oper crite “Queue Sofert duck frodure for uum uring omys SBD whet He Chttuter queues urrite tam US adendyy Dy iaeddantges. DNS Pitblien ting Oprenie. Abierdion Ory. Depa ble arse lénted ats S a apecstiy or Sgt Weta Lats Commie G) Delete Anode fom Ae fmt Gh) Caertcon ,. ey ke eUa A LC Jape gihee Gey aC fondin to td 2 ety svt Mitng Gig Uday Mut. Mas Ba pet Stoctes Qussees obey Getea Aive. Qi wee 9 Gated Ginted Ait 2 Out Ateent ty 2 Pats eee BD whet BY Gruber daly Loud tub 2 a 6 fumctim te ftyerm the Fellaning, Open on Ueulee leaky dee at Gd) Piettin Gil) Dehn OCeeypeecequreeQue iresy Tee HE sues any Hr props 4 teneny Oe png “Stender te Discus ee eme ce one 9 Gorm Utd He pau cnenbs, pre ie, psbatder & Lend wer tas tyes meer) th Seibert no for che tga UY beer. Gepeon Hy taycy vith Cuctatle ores Frierson sinany es fnsonple A ie Sc. aan. cee tt PAs: 4 La SO yd ge Se biney eh tree L, they Ba aery Ke Uvted Cor Dpresnichien 9 the Se a Fr mo,DG EH rag, iH dele exemple SL is citing the fllnsing is os G1 tyre. of = nade. °@ o Gy leva 9 @ beneny re Uy empl ery ee wr fall enony bree Priblens on graph Mc bree, ED Dents C Punctamy de Unntlemunh te fUlaving BE a sy Sumth tote My Uptng 2 Wary tree PD ain compl 9 binary serach tree & 7 Way We mentaing He dey 9 Wy tomendy => G) riestin is Aetcheim liy Sevachiny, ( Nemmstvthion 9 epertemy SRRC UM erin | “otlthdn, Treloliticn Leiner Meme Der ppc As ta Grpteesty of rvtenity Pee cqecstiny in Mins bampenntchiars: Coyocn how Wy frees are Whof Seflnest poy queues piston thet patentbies K cchventeyts epene potently wes + Differentiate Huy Sr endeh Wy doth ended PMY Went « Seargcn tras plain Dene Ae) Hey tlink dake wore Bore cmnprtrte 9 ord eNom Yel tld ing aan Kinny Storch tras OAL wed to He date ‘Fehnnl gastos. yriens 5 cansucting 20 SPlm al Irian Seen te frome Gin ee 9 begs bethee potatos