Intveduation. fe Data shuckwits we Data struc = + Data strut: i 6 pebbiudan wey of sting & Dganitiny dam iw a compat So tak it cm we ned cat + Daim staubunt 2 a special formnak for organising storing date + Gemerat dal chuutuaes inuude arms, lee, Unbed Lists , stews ete Dara shuturr ik es ased on Ovyaul zation 0b elemauats Linear dota shuture Nom- lives date shutune F dlements ane acessed in a > Elemat of tats date. Sequential owder, but not studunt are stored | ausssed eet hak ah Clemints im @& won- lineah oreler- aru stared serjumubindlye pears Atte Stee Linked cts, stakes, * Cae queues en: AE Abshout dake type ADT ane ‘eutities teak ane dehwatons of dam % operations bub do wor have implementation details We Know the date we ont storing anc opssatfons tual Gu be prtormed on date , uk we dont know abou imptinentribn details “YE iy Caled atest beaunre it giv an implementation - independant vitw Tape List, sto, uewe features = 1] Avshmukion :- The usen does not Know tt implemutution of dorm slvutunt, onl aatiols an povided. 2] Bet wnuptudizaton - ADT Dies wie beth unuptualization oF tue Seal word 3] Robust the pregnane 5S wobuse 3% bas abitity £0 cate errors ui] Enepatakion ADT wider tre intimal details of data q prove a public imnntae for users #o iterate. Tis allows easier m™Maintahuante % ModiHution of data shutune- He rdventnges 06 ROT .- senodutantty. atuows gogiams £0 cvowat undsAlying maplemnakion of dake StL witwouk attesting sytat of prams Reutebitin 1 Con be wemsed atross aittntnt pregtame witwouk amnodibietion Maintninebility :- Bq separating tue twtcntate hom tae _tnaplementabion ADT: make wole earfey to undated £ maintain:de state vs Pynawic iwrplenmentation + Stic: Heke the size of te chute is Hrecl. The wontent Dt data stusture can be mooitied bur witwowr Ce wrong. spat atouked +o it: ° Dypnanaie r= WONR, the cize of the datas wot Hired 3 can be maoditied during hut openasions portormred on it + Thien dunigned to eauiti tate a of data shwkunt in run time. Stake Dynawt ce reemory + Mwemonge is allolated at . — is aroused tous Wuupile time itselt or yun time size + Size is fred & + Size om be moattied Cannoe be wodihed uaring suntine Mowery + mage be maubtient is ttHuewt as it Caner Utilization veused Rcwss + faatn, on it ts Hired soma be Shower dine, 0 indesing, and pointer wie 1 = Porras 1 Stakes, Ouenr Lists , trees (vantouste size) Trees (wite fived cic) tee te oz: oa Se of starie dota shuubwrt :- {] Fast access time t- as ertimont if otuoiakedh ak compile time iesat 2 tied Sie makes aces Mag, ements simple indexing operation 2] Predictuoie peed eo The preyfamnr can easing predic how muda. Meeunong- will We usec oy Tne program , whith it an adventae in rasimonge towatmint ehvivonmeate - 2] Gase of wpementntion # optimizahin i Gasien #0 iwplemtat optinnine since Stustine % Sine is Heeel , algovitums tan be optinized tor spastic shut: Ui] Eient manors mamagumunk <= rntmee cam ve aihouted veleased etdiiteath witwour bequunt Sutoustions+ Prdvaulanes of dynamic dota stuutwrt *- 7] Flevibiliby. - Thre ds au grow # Shrink ok vuntime os nested , oMowiog them $0 adapt Cnauging data vtanrireneaty 2] Reduced Mennovg waste i since aynauate data svuuwus an wise tummdves , hep vedure mewovge waabngee 2] proved purtorwance for some operations :— Inserting B deleting cements iw widdle of dynamic ist cam be faster , sin Cements tn be Shited wore oe il 4] Sedabilitg i= Tse edt more salable trem sane DS as tee adapt to FE Time couaplenttye 1 AENOTE 5 Time oe te F time tare by code | pegmun to run "The wawplerity is the rate at whi Te tine Aken ineweases wart fb ce ania ae Time wwplenity is expressed imtams St Pits { a big (0) wotation- fe me Tine, cowplerily 0 a0 go 4p inpet Sise i ala dakar Face time weuplerity. for Tee Work case Scenario: + Avoid comstats yy big Co) motarion, as Teste canbe meglenred tor o(ane') x ina ono Speen Oa ol an* Sv. + Pid Lowe VES lich are maaageie- Independent ob the wathine 2 its coukiquiation; On wir tue agorit Xs ce shows a dived elation with tre nmin of inputs 7 && aistug uit two atgoritims dearly witnout obi quiteSF Some Www time cowplexittes— 1] onstent time = [ OG) ] + Te etgoritumn foxes tus Same, Kime weyendtars of tvs mpus sine em acess a speLitic elbwenk im an Array by indering 2] Loganitianic Fim { O(4ayn)] - Rawnivg ae ‘mcranes Loganiturniialig with par sine epi binary seaach im Sorted ansn 3] Linas Hime [ cca]: Reins He events is with size of lupe Te — Clennents We ane 2] Lineadtumic some [ oC magn) 5 Woabination of tinea 2 Loganitunie qi maye ert & Suter sort F] Ouadaratic time [ ot) ] manning, le Imevennes apna i addy. Spe aprtinn ite nested Loops ive bubble sort or insertion tort 6] Exponent at soe | 02] cane Ate doves wit eaur adibiont clemt qe Space soreness Io + The amount of memo’ egprired bg algoritun 40 solve given problem is cated spare complexity a me auacitiany Spe (Space to steve re problem) F input spa (spate to store input) + Aysin we use Big 0 notation to demonshele spare comaplextty Homme spare complerities {] @nsrant space [00)] otgoritum user a reel amomt of mrumony . reqandiens of impat si2e Sy Swapping. 2 variables 2] Linear epase To lay] = memonge unage grouse tintnrty wit apa sine - Sd an adm of D See 3] Guards spe [oper] wage qpaws ounamtentig, athe tape= O Notation + A matnematiot representation used FO desvibe tee uppe bovnat (worst care senario) of an acgoritum’s time] spare Comapien tt Big O truses on Lominent tam as input siren’ no seat Teac d comstants 2 Lowen: ort trans. + O( ante Sat 2) stpitter to OCn*) Leame w' grnwi eS aap ye Hath than ofr teams at Tn Werensen, +E Applitation of Data stuuhures:— + From simple to cophiitiated free shutwt & graphs , dai shuns Po Vitek hole im variour dewaivt im seme Extensively wed im duynauie Progamming tire Rbonntsl series , mmatix Chain swutiplintion oft Startling Sorting dita tinny Seance, gull SOrk, maudge tore om. + Also utp in implentuntation of complex smutuns svn os Starts, queues eb Linked ists Helps we elficienk: vitmonp. wamagemit by alteration and aatonsion ot maumrony BLUES by maintaining 4 inked struhiae ised algerie caluntations » to represent y manipulate polynomial ae Stak :- ch ured for converting 4 evaluating expressions estembiok for managing tumibion GUS iH prognau a Banermaeing alanori tana sudan as deptu- Hest seardn rely ow staks to Keep tak of vitiied woles & potential patus. Gurues . + Wed wn tue wasenagtnntnd 4 job Sunedubing Systems + Breadth fivet stanch atgoritam expiorts gfaple in a devel toy davel Wanner making Auer ar ideal dain shuahn for meiutaining orden of traversal:Wee 7 Rte systeans ubitize tree stuntwres to represent diretory Wetvanuies + Frees are used im daimbase Indexing ctor etidient searaning % vetvieval of yeuords - + Usefua for peepee) Wtirarunial veiakiouslups in XML % JSON dat + Deuisiow bees & game bees ane empteyed im aesision making process. Gaps —i- + Essential in soctal network analyzing , enabling appliatrons SUA oA triened redmmendations , community detection - + essentiat in networle routing adgoritnns , detrmalug shortest oy optimal patw between nodes: rusted tm Web page vantting atgoritums, bisintormatitt 4 compuimsional reeds) Hash tables = . + provides tast vetvieval ot data, suitable for iwdexing Seardning + Wed in casting mechautemes wr Aakwlensee Compilers 4 interpreters Use hast AbUS 4S symbol abies £0 Stove ideubitiens, feywords, ef during couspitation % execution