0% found this document useful (0 votes)
15 views

DSA Assignment 01

The document discusses various data structures, including linked lists, stacks, and queues, explaining their characteristics and operations. It highlights how these structures manage data, such as adding and removing elements, and their applications in programming. Additionally, it covers memory allocation and the importance of understanding these structures for efficient data management.

Uploaded by

anub.bhavkumaar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
15 views

DSA Assignment 01

The document discusses various data structures, including linked lists, stacks, and queues, explaining their characteristics and operations. It highlights how these structures manage data, such as adding and removing elements, and their applications in programming. Additionally, it covers memory allocation and the importance of understanding these structures for efficient data management.

Uploaded by

anub.bhavkumaar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 10
AsSipn tent od ts eee cata aucwchke 2 List Vavious near end non = Wacar deta Steveture - Ag A deta sateetece ts a Zz of aie ce emt Capea data in ia ‘cont Pote> so ean be YW accessed ant used Secee - ee ~cefee +o —the lopical ee ptartha tata) sce Pee sen tation CE deta, aS ett as the tot Plenertetiorn In a ConiPHor leper vr of Seta Diets (0 Linear Spete gtevetowes ete es eyed Seguentialy, and Slerterts ore connected mH a Winco odes. : WT. A cettestion of ctanerts Steet at Cana er tecations . Linked Kst .— A sesice cf nodes Chee. cack ede — conteinS data and oa xefevence +e 4 next nede. Stack .- A collection Fonocine Hee Lest in Prat out CO LIECN RinciPle Boeve .- A ettestion fitlecine +ha EMst In evse Ovt C FIFE PerncrPl 7 SBegve :- A deubte - ended greve chews Clenents con be added o ~wenoved Fon bet& ends. 2. Non = bree Teta Stevctuwes: moate ts ped oR Nieweehreal ow intewconnedt pareve’ - wee 1- A hewavchreal stwetece consist of nedes, orth a root rede and Gane vedes Cop, Binay wee, Bins seurch Tree, AvL = S. CC - GeePh A cot of vestices Crodes comected 4 Geeafh, — undivceted edees Ces. mpected eal. weighted Gealh>- oe used foe 7 teaP > — A sfeeral fe of wor ake. Petey - based ofenblons Cop OCrax Heap, tm HeaP S. oe here = A tees - Uke Stectoee used fe efberent inferration ~etereval- 2 Exflam Hue oe “oe allocation Lmneton Ine Ass Dynes tere atlecatien mH C& welesS to he Pocess of allocating er dean Pe execution | as offhs +o rect ga allocation » eshick haffens ee — CortPile ce aoe atecs — devetokes te ~aprest — ery as needed and wclease 4 hen me lene ~seguived , enabi creer rene. ‘exs ~ a e Foren: rene a attecetion Lncten in co. < Reovrdes four stemdard wer functors fee aaa me allocation , Ztweh wen defaced Zz mean mallee C> oer Allocation S Alwcates tock of en of a efecifed size Cin sy: J Tre “allocated ment es uninthatized. of the. beet, . Retoma 4 Pernice ee ~ roelk fo attecatron Oe 2 calles > ma AllecationS + Allocates Pete ot “er elenests , dnrealize = ten Swe ze, land ae a Pointer to Hee tert x weattee €) C Reallo cation) . ean exist beck of Herop, weebs ps patet(Y% as neck 48 fosei ble: mew size tS ox 5 ekbre eee uninitialized 4. Pee 0> C meallecationd i - Frees Prevtovsl allocated tena, rtaliy it none Pee TT Hide and men R- apPewentate letseen ata sheuctore AS Peeve Tata sheet | ens Pi iidive Theta shot ts Basie | built -in date s | conflex data yhes dewwed ' Reovided the lear Feo Priartive dete: ae CO | seetewes - 2: it Ep tat, fteat, char, Oe Aveuys, binked Wests, De sce » boolean - stucks, Veveves, Tees, Guafhe , ete: Bi Singte- tevel and eterna | Hue level amd can be Cvannct be divided fietuer)! byotien inte smaller contPonents 4 sinPle +e use and mew conPlex and veges tot Plenant + De or" to tet Plant Ss Fixed - to crete a atx of Size KP cH ell Clenerte inttalized +o O- Be Mteki xe rule Plication + Fee each woo 6 tn A? a Fee cack column 5 in RP a conPte tee det Redvet of woo 6 of A end coturtn 5 of BR: Fer Ks tl ton: ere = ef +are{ cl +x @ CKIEST) " 4: ovtht tue Resutt + Rant he ~esuttert matix o. Ta Se con Plexi: Analysis > J -outer tooP Cwoer ¢ of AY: mH itexations s middle teoP Coownn 5 of BY: P + Fanew 12eP C dot Product \- Mettons A Henectiow s Tetal itewctiors Oo Cren.P)> Mebvces of size nen» the Hoe soe iy fst ogn) C6 what is Steck 2 ExPlain He exanPle « Fee sguace Hs basic oPewertion Ag A stack iS a Uncar dete Stevetoce teat folecs tee Last ZH bxst ovk CLTEOS PanetPle- This rteans hat the last lene ct added +o Hee stack fs the Fret one te be xertoved oy a stack of Plates: +he last Plate pYoeds on due +P ts he Fest one cereved. — Basie ofesat’ wv Push re + Add an clenert +e Ke +eP of he Stuck. - cf tee Steck is oe and ou Push etenent JS eteck lo, 20 and 30, the becomes —eP — [xe, 20,10] 2. PoP: - Reseves tae +oP clerert of tee Fee the Stack [s0e, 2e,10] stuck - Ss ? Berkenrins PoP > wenove To esut , ivy tH = =eP > Leertel oS =. Peek Loe toPS>- Retoens fre value of the +4eP a. elenent ee Wye A inked st is (Fee te stack Dae, 26,107] er eee l | peek mretene and fee Stack <> toe: Be Wenains Unchanged. 4: ‘sels - oa + chee wheter ne Stach ts enby + For an oe Stack, ts eb & , vetums tree, = PSFoUl tA + ehecK whetier the Stuck cs fon. - tho a seck of size = contains [ae,26,10] ts Fell CS wetter 4eu]e. 2. Whet s Linked List % ExPlain its pe rte exec « 7 a Unewr data Stroctee ecatled nedes , ave connected nede contains. Sate 2 The value Steed in he node - welevence Coe addvess ) te ee mert nede im the Seguence- bes of Linked ist Cay Linked List < - Back neds has a Pinler to he next ede. be feavessted mM ence divectren . wert £ wy cS J NuLk 2. DWeebr Linked List» — + Fack nede has +o PowlexS , one to he next mode and one +o +he Previews node~ scan be teweted beth fed ind baieoard divectrons. ev deta eget A Pew dete were P< C12 4 Strela Tee can node feces a civele. }=——* Teo SF Tee eee Lintled List. — {S$ connected +o the Fret Steet ext ay mode and desavexsSe the ee Ae ate pnent - & te out > ( nm GE 1 BZ What os fveve 2 ExPlain te olewetion = Om eran - Age A gee " a linear deta Stectrwe +rat folors tee First mn. Fit out CFLFON RanciPe. his eans that tee Pt Cterent adda +o he gueve es 4he fitt one wertoved , ruck Ke a tine of Peclle atin For a Severe. CO ofewtior® Tn a Queue i Wi Engveve 2 = Adel an tenant to He cae of he gues 2. wegere 2- Renove an cterent fer the front of 4he prove: Bek [ ent .- View ee font weenie we 4. eEnby te check PF we gueve is F Ss FsRils- cheek PF me ef a bownded geve). eletent Mtout geeve ts Al Lin case ExaPle Oe 2 Greve at a movre Heket countex + 7 SeP A - PePe Som tha tae Cengece). ewe 2- [Peter A, Porson R, Person CX - steP2:- Wee Persson et toe Lowt Cancel and leaves CO megeere) eee deaverisn § - [Person B, Porton 27]

You might also like