Very important question for dsa, Cheat Sheet of Data Structures and Algorithms

Download Very important question for dsa and more Cheat Sheet Data Structures and Algorithms in PDF only on Docsity! Name of Practical | a os An abstract do: cE =e together with various ica » BHAGWATI PAGE NO al DATE } Ae Aine ad ie aa ge ny examples. the miabical mode) — L- With an ADT te users ate notconttraed —— pith hon the tas is dene, tathtr, they need tobe concerned on mth wath (Land — : ae gap tos Ue nsf ache Oy ce) iby | Vit, Ft, a iy eh Teil ay efine Labs Lruclures CRE yo | le Ample dah clwctures is away for ctrctiring dalla ie way of s boring Cain 2 pale sata f Lt Can ‘be used ettkiety. eS sual ee consists of two thing st Firs fe is. the Lype-. eof | elett-a—strutre thot we are gelr ousetaS$are dotand sectnd how eth jcien ne pertorm cperntions euto Lhat- ee pe abet 90 that it results io jess executions timeand amb eer 060 Fog cepiice- sae Excomple : Army: Ariay is_ (near - dette 3 tr Lip the collection et &imilarddla t eee a common name. The Clements ofcanbe acesséy with the helpot index. Arua ts stilic Mocatjon— &$ of Q 3 a le fiom ae pi tinea array Teacher's Signature Pg BHAGWATI! PAGE NO. DATE aa —— | we: Acyutue is aimee lia bof F chmealein_ — 0 Bae piemini “can be insetled only atone eva — | ealled the rear_dod deletions Can b he tahen place + end called trant. So gwvewe (era) cd es et a eos CHE. adie because test — |_ele ment Inagueds's fhe ficst element ut. at — ee sal gis » SA ab 5 aan ea eee Bi Freat —> [ie fze, 20] 40 fae A ae __@3\ Weitean algoritm for in inserlien andddedorot "particule Litem in light ed List rhs Ape 4. Creale anew nodewitht he giten value (2.9 te circubr ln hed lislisenply Chead fs Nile, set the | newneds asthe had a, | Cie: pewnadle —» next= 2emncde) lo. the bist is net Enypby , traverse thelist to find the | node_hetore the desired position, \¢, Seethe next pointer ae pave pu-/ al fe fhe | pext node cf be ie Be. ic. Update 1h hes t pointer o tthe Banos hode 4o_ | point to the new nodle. | peletion Algorithm: 4. Start with the curred node as the head and — ‘initialize a previo uS hade as VYL . Traverse the ciraviar linhedlhs tone pode ate Ein, ~ Teacher's Signature  BHAGWATI PAGE NO. : DATE ‘of Practical Ho by lop , 7 = Stack Thon 1, where “dalis the wlve youte _pepeitg ton Lh stack, the ? Leiner tp point to the previo tus elemenl (4 rokve the eemerty24j uP pe peel) top = bap= P? = tionally cetor a theppopped "ata or take 6 action witht t as peeded, 96) || Convert into ¢ postfix form : . | At (8*C C/E "F)"G*H | BE - Synbo) Stack — fol fixe A 4a A + + A | a +f A B +L AB e | * +]¥ AB G +x AGC ii +f-E ABC* aaty +L ABC*O me |. +£-L7 AbCED iE alee) ABC*DE A w/o ABo*D EF me |. F ime AbC* DEF : 7 tha) ] ABc* DE F % +[-x ABCTDEF 4 Gj +[-¥ ABC*DEFC/G wie Teacher'sSignature of Practical 7 BHAGWATI— PAGE NO. a | DATE 7 ' —j—| + [-* 1 ABCIOEE VG __ ia +k ABC*DE FA) fem eee Ay a ae 5 SAARC pee ieee | -Symbo). ame SPapk B Cfising ) Eee ee ees Cree ee a A Ge 1 aa Le SS Che a ae La ve + CBA | f =? CBRKAtT ahs Reversing She. the string > +A BL < Petivtorm yal | Consider _the follow ing queue eue of chanuters where QUEUE js acircvlar_ array which js allotgled sy ot memory cells. ae FROWT=2 REAR= 4 QUEVE : _ALDE a.Fis added to queue? ACDEF Front= 2 REAR= 5 b-Lleters ore cklele!:_ ACOEF __ Front= “4 REAR=, a AKL added tog ueve KLM. EF _ Frent= 4 RFAR= 2. “Two letters are cebhd' KLMOEF Froat=@ REAR: 2 = | rsate deleted: KLMRE F Front=2,__ REAR= sa is pee fothe gutue: KLM RSF Frent=2 REAR = Zz e Bh _odde doqueue ~ KLM REF Froot=0_ _REAR3 ‘Teacher's Signature__ BHAGWATI PAGE NO. : hwo [eters are dolled n- Two Jetflers are dele ted RSF Front] REAR=¢ i Beeler bide Hamnst tt REA ia Eg 2 5 deleted’ briss® "Shack Under Flow” : vi ctical