we | AUnib-no=y » ° | Nia BO a Representation and xmplementatlon , 3 | Comparision bot? array and linked lst . @.| write a difference ba” array and linked l/s} ‘J |e OR- i | @ [wile a limitation of array over the Unked yy iS Array linked (ist tt 3 pioicsekel ome ae HIGHT - Stove element ina contineoud Memory localfon contineous memory localit [FAn array containg only one mthe linked [fet Te comes of anddes consisting of | [Field which btores. data element a two Freld¢, dota.an addvess.., : | f An avray.ts a choles thakis - the linked listig dynamic Memory size te Fixed and dota siru clure Whobe size cannot be updated ak the can be change aka wn auntime time. I-The element ofan array are ~ the element of lin a Indepenclent of each other are dependent as the + ladclsess of next mode? ~ stored in the pre vtov® Node: saat = memory allacaion is done 2Memory allocation ! barnes Ae FAMINE TIME a @ scanned with OKEN ScannerSince Memory aegionase = In linked list insertion ond Fired inderting and removin! ddelion operation are quick 4 ata is mor expensive lun comple cated - |= SI2@ semain constant - Size, grows a sbagenking When | the element ave ins ext-and ddele| \ Representation _ | | | | aya ola yo]a nodeD, mode) noder ~The linked (7s) consis? of seviés-of ghiuctute H arenot sequired jebe elored location. ney th adjus tance memory - Te structure constit of data Held and address field hee the dddvessHald contain the addtess of dfs gucessive nexE node Figuxe shows the actual! ‘Tepresentabon of otruc tures Data | address | * Yepresentation ‘oF siuclurvee . | i “A vorlablé of a above etructuce Eyre is conventially | Knowry as node -Figute, Nodes . veb the representation of a linked lied of three @ scanned with OKEN Scanner= i sy 7 | ’-—-—+4 NS ETO ES a . | ode A node ® muece id I 5 *Cinked list EA liek consisting of. a Three data %, ,X2,%g ig i wepresented using a linked list aedex eG node A afore the dala OCs and the addwess oF next a Node B Hera the nodep store the data va and the address oF next data of nodec and node t «contaln the dala of Y3 and ftg addsess Wald is iE gesunsied Chul pointer’ Padicating Tt does not [i ave Q Guccesos i Ly ng : T i | =n this Type OF Thked Tet Yoo Successive Tede oF | a ‘inked Wet are Wed with each otha: linear manner in sequencit = Ploment 7® Fotunrd Tirection 16 positive head @] & | a1 4 z ToS + Fig ¥X6 sng linked Tigh ee ed @ scanned with OKEN Scannerfal dixection n =F ‘is not possible 9, can element is the Te LET SE | 7ase lion ordeelion at the end |_it is oF Inear ordee + toate Re. ¥6 time consum ming fa |- In this type of Viked Ws each node holds hoo [pointer Freld. | 7 1 | 4 | [tn dewleTinked Tit Qddséss oy of! nex't-as well as | | previous Urment are linked oF curyenrtede - | 1 ; | q fe] S43 Tape 2 I {TANS = x 7 | - + double linked lists =| D = ie pe [ee nextnode “Figure is Tepresent | 7 Previous ic + mode a. i A | | node of double inked Vier “1 [Oates aR $$ 4 | 1 rina _cireulos list fhe Aestand (asf element | ~~ I @ scanned with OKEN Scannerey are adjustant f Inked list con be made, circuloe b stoi. &t fags. dhe address of the Five node is the n oF lasknode. ' yond =o =p Rede ® node 8 nod + Cireulae linked ligt + ‘| We perform Following bast d& linked lish reating a linked isk ee Operations. \ -Travellsing linked |i5} 3-Prlnting a linked Is} 4 Counting the nodes in the Unked lisF. | $: Searching and them tn "inked Wgt | 6 Jngerting and item in Wnked SF [3 ddeting and tem 1h Tnked Tey 3 Coneadiating two list ‘ 9° Inverse : No" Sorting of element alors Ina linked Vist W Merging ofa fo. Soiled} ink ier \2. Separating Ina Voked list tna Gwe Wnkeed 1! © scanne -d with OKEN Scannerody ot Tani? ina subsequent Secti containg “veer bo 4h & struc 8 Funt? associated with linked i nal Provide 08 Tey ove (ist discussed | Ca int data, Struck node xnext 5 Ynede 5 F noden Pointee otravesal strat) from fitel nodes Pingh Node = Traversal of a linked list always otal from the = In order to YWovel in linkesb Ted always forword | ae divection 5 — Traversal + 18 assign. the address Wst cand B pointes type voslable OF ‘first mode p= HEAD @ scanned with OKEN Scanner| ON | — an ipegram Slatement ps HERDS. 1 ~~ | : while Cet s mole) + : FsPoanert 5/% nevt Feld g 4 ' mode pointed by P contai / addwess cf next node ¥/ Fone Hon for +h ay linked st) _€ todelele a node tm SLl Céigly line adetin a node From the list fs even easier tha [insetkon a8 only one painter, value Needs to be change here again we have th ‘ r 2 Deleting first Nem Hee ciluatton 2. Oeleting last Tem. > a: Deleting From th middle of list: i _ — FC? functien teoddded a data from @ linked iis! i are 4 @ scanned with OKEN Scanner[Node ¥ delete Cnode ¥ head,intx) | node xe, *U 5 g \f CX == head dala) Te Adeling the Flvet them &] P= head 5 head = head —> next; ll Free CP) 5 4 28 1 else while Cx\ = CP> next > dota $f po nex= Nowe) P=P>next 4 iP CP next l= nur) | x Ye pnenty Prrnent =CPeynexti—next 4 FreeCa)s an i ¥ T aeturn Chead) 5 SG @wWeike an algorithm’ to search’ element inthe gigley link “fist 2 y ; —>n order to search an dement ina linked list we stort traversing in linked list Rvom the first nod e| traversal ends witha gucegsive iF the element | ae Hele [% Found: | zF the dement fo nol Found then euch geath jn oa ailure « @ scanned with OKEN Scanner\. pehead 7 bu pt ¢. iF the dela sored to node peinted JP 7 ——F corch with success * E FF end 6F linked Wet then 1 £ ee . pe poo next ie adum (ods Nol Supper pointers TF Naked! ers are Mot’ available-then — yeatec) in an axe ay | ~Prany langua . ane Fequised n [ln ked MN —~~>——— ee n ow @ — tod tede an tan data an op | : Hehe Hext node —_] Bypamic memey TE Nana ge Tigh mallee’) 9! : a @ scanned with OKEN Scannerdinked ed [rst Fay Nede index can th can alse bexhehdle pe ‘Cink modanl2|Lmar] —f a8 Condition can be 1mplemeny nt wm St Fee cell ee mt thus cell can be conpected te canara | ind ext m Fivet cele te ell zero - 7 In aciscalos Worked Wet \ast q ' Node ‘is connected back tothe fist node In_sUM application i is 's_condinien to use, het linked Uist i PA Queue doba tuchute can be implem ented using civeulox inked {et with single aint er “0 ih tronl node fen Ge gucee hcg i ETO ON Ge Gecess th @ scanned with OKEN Scanner= Fnserion ofa node at the stosh o* end a cixeulos linked Wisk WdenWified by a pointer fot: last node of the linked Wo} takes_a constant Tamount ofa time it 19 serespective of the lengh ofthe Nnked list: [PAlgovithrn for faversing acirculoc linked list is clightly different than the same algorithm Fora Gigly Connected linked list because Nuvi itis Dot uncounted Compare cticuldt linked list with singly linked! Great Inked NaF |. lnalg Unked Nat ! Siogly inked. lS [FReader node: point to last Fhead node point tof [rede Incde i = Ensertion at He beging m F qngertion a} the Begins The consfont Lime . mthe congsank time IE rngertisn at the end — |- Tngertian ah the wad sn a constant time - |tneae dime : — @ scanned with OKEN Scanner=ddelin of the Firel dement _-deelion of the Fist dement io | ino constant time. Jo. conston’ ime | -dalctton of the last dementin -ddelion of the last demenh a Vinea Hme, wn a pret Mme ext pointer pt the lost node: Nextpointer of the last node is connected back {6 the 6 grounded | Fivst node « me = Ln a_singly linked list we can easilg move in the direction [or the linked link findinding node presending any pode hie a Hme consuming procese ~The only way bo Find the node which Brisides a nodets Ito stark back at The begining of thelist iF we have la problem where moving 9 athe divaction Is obtain | Mecessary then # is useful to have doubly linked NSF leach node has two linked Field one linking In a Forwar IdisecHionand one tn the backward drrection- Node Siuckure of doubly Inked Tet 8 =A node 16 doubly linked list al list Chee Fields 90 | dako”, “next?” “previous *?, [=A doubly [inked list is shown in Rig pode A nocle B pode © pe] SES Ss EL @ scanned with OKEN Scanner‘Structure of the node > oN [Ef node of the doubly Inked Wet ton be deFlnay— using 0 Following struct ¥e- : - 0 oi type dof hud dnode Si ‘ink data * — Struck dnode ¥next % Pred's ‘ ia Ydnode s doubly: linked Tre} number fo be cveated » L Figure shows Stepwise insethon oF the three Denali | mamely §,2.0nd 6 ponte Ot used Lo hap insedia_ _Jak tore of Wnked Vet - : rT | [Weed al toitially hed f6 | Lt Nuit T @ scanned with OKEN Scanner‘AccuremeMorg For The new dahaee Stepdt- LC doode® ) madioc (Ht Size of cd fedeyys {se o> ote & in Wh eg nuly occqtived nee ie node q—> dala =© \ — make previous dnd next & ade Qis eaucd bo provlouss y bege G—-nex -null3 [case 1- Inserting ikon empty Ws} Chead =-Nall |v? Chead = = WU LL) head P= LS a Case 2" encanto inan np no empty list : Chead = = Null C9 head P29 3 5 dse LP New = @ scanned with OKEN Scannerdynamic memory mange IX Implementation of double ended quetre at ment by oper ~Implementation oF a lineoe list af integer. - Representotion ofa. long decimal and bin Number, ory = dmplementation of_ variable Name string dala _||_Structuse. MOwle the diFFevence bao - s\L and DLL, singly Tinked Te Doubly Linked lish ' Node structure of sit is “Node ojructine oF out hiven by [Paka] Next] §iven by [Pre] Dalalnent the nade of slb yequited less Memory ~The node oF oie veal Move memory ag iigak? I Store The advegs oF pode Fst isusetul when the - Both Forwaron anda algorithm requived scaning of dala, only inthe forw- asd drveclion seoulved less FiMe = modini'cation operation | Beanping of data i posit! as Di. ne Modificedion operatic” “evequiyed meve Hime © Heboth dhe mua @ scanned with OKEN Scannersackwasd pointee must be poker ved + __|-slack ond queue dqueuie canoot s be implement _ | - efficiently j eeeauscll J bul U ns | |dqueue cannof be — | !Mplemented efPicleniy | | - Only one linked field - Tuo linked field Hence additional memory Tequired Madein every node- Mwnite_ashort note on polynomial \inked lish - FA polynomial pcx) of degree ina define by the. Following expression. POX) = 6h 0, D4 Qa xX? + RAKED I-Wheve “An, isxany seal veal numbes and nie the integer a polynomial: con be through of an order Net of nonzero term each ‘term 6 2- tuppie | containing Power and | CoeFficrent Fowesg, 6x +4uZ4ie=co ie re resented and Dee arr ! | | Pret Te) Eebh] P a! I- each term of the polynomal canbe defined by the al Following ofruchure @ scanned with OKEN ScannerFloat coerficient io} power 5 Struct pnod@ * next 5 4 pnode rWe can treat a polynomial and_absdract dole type and performing following baseic oPevahig, ~ 4+ creotng a polynomial 7 a: printing a palynomial & BddiHon OF a two poly nomial 4: MultiplioaHon oF a tue polynomial “ S Evaluation ofa two polynemiale, + Represent. the follawin g Polynomial using jinked Ii Bud 4 2x34 FR7 ¥ 10g, 8 ~ Struchive of node forthe Yesentabion | | [Powers] coerFrctent [next KB : EeTsTEfeh [3 A Tel FE Jols # | * Figute Tepresentation of eclynom ial - TI —H T 1 i | .$- feopeseniation of following | Polynomial using Linke + | x ey 29x35 +18 295 Gigt tier ag ayaa ~ Structuve of node for the. ae Fe Senta oD @ scanned with OKEN ScannerPOR SOS AS OIG Ce ion of polynomial oat TA sek of useful operation on aquete include A toitvalizecas Thilialize aquedie by seting the Valle oF yore andvPronl pointer to Nolet - a NGUCUECI 3- Tnserl and elemeni al ihe vare end of the queue Sdquewecd &- delete the Front element and writen the) dame - a empty Cd~ Ft swritken true ci) 7e the queueis empty and veluyn6 Paloeloy if the Queue 18 Not emply - Be print CD s- TE prints the queue element brom the Front Ewo reat hese the data gttucture declavedtton type dee type def Struct ned a : : £ int doday, wbtiuct Node #node 5 Y node *, : Autre def elrucd @ @ scanned with OKEN Scanneri * aa. | I | | ee ee a F 4 @ scanned with OKEN Scanner