| Assignment-4._ | Dnil=aTetroduchion ta Data Slane aa. Answer the fol owing questions a Deine Data Staucture: [Sl Data= The data ca de ee | value ov the. coltecti ono Seerrar dtoulume ‘cam he defined as the grup | —=-24_data element hi h provide s an sfcient | | ovina Gnd _ o%q i \ Sault % so that it som used effic ent, =, Th isthe + OF any pangram ox the _softmare- =| Thene of i i) prtmitive Ji) Nom -prqm iti awe d. ley output. imple ti is_generally created nlepelak nde =ex | 1) START — ii) get values of o &b ii) ca atb 7 ‘Ww i iG _ D_ - STOP 2) What is pafamilive das @ ; =a Primitive date Stmuctuxs ane the’ asic. tdi te ie [the “machine _instouc tions. ali _lengain— as basic dash hue | oy we ange — ik is” built ie =| ox i te ti numbed -and paar ie . - =| Tt com store wdue-at only oe dala dyepaintf (“ Bo, Felwm 0; 4 [e/e—=—10, in this prog. 3 imt var. are used. size of Mint abla ype is Zon 4 byte abi doperad Total space is ocupied hy Prog netam-e 1s —§ 4# 32 12 bydes: tthe tines orned iy” ran “lganithen “given any ees devntes the Tengesd zanming time va) oF an algorithm. ca not oly. om the num oi isw’t -fomd in crx the algo. males = EoTparisarsb date : pe_is ian Ya a apaikie hich type o Value a variable -has_and_ delation can. ied it ai Cau = an CS5O%e = There ane two type of it. f)_ Privnitive dal p = Te 15__ peed Thy 2 praceiny 0 ied an no _ad ition me thon Premitive dada typ im beger ; character ban lam 1 L ~ oy - byte ~float ~ char ~bsal long ‘= double ~ @ =chax c='h’) boolem b2 ht = show ex flat n= Lo ~imt = i 2 ______(exe int a Ie)[3] Dmambjquous :- Algo should be clea anel i) Taput - An loot showld have O 0% mare | Ae og imputes (a) Out ~_ fn algo 5 have 4 03 ‘more cf) ia ane Tt must “terminate. after a finite ; | um. of steps y) Fe asibility- Shoud he fesible with the avail abe | Tesouree= \ ; ve ste I _of cade. Q.L\G) Define the bewms- coynplea| the time + i) Time iene rarer ae salen by select - the vent hen a. eimnple pab.- can ole ste snethal | See elie ceo oF memory ‘Consumed caval tos(iei, i<= itt) fox Ge (pees jet) fox [ua hea} sD X= X +13rem oa 4 , 7 ist 1 eh 7 jem nel I it vn (en nn 7 | jsei minty) | \tr nen Ee k=) nn. __kéej en(nt1) ime coraplexity | | ket VN : = OLn 2) msde th nen oe don? 430? ant = r _Q 5), Fafa : emer = “analysts a eae | algoni = Avartage case lime analysis are ‘a vobation | of an “ ovanaye” input”: to on_algo. which is | Teads bo problem ‘of devi stag a — dy | digki ution. -oVver inp — a ay ny calculate Thao c “Fim we pasties i ees on _devide the | Sum. by eee of ‘Mauls = =| Fox the linews search problems [et us asame that all cases axe rmitoamaly distihuted: So we were ‘sum all the tases and devided the Sum (nti) _« =>/er dex Gn ovtay ‘size F “with 4 ca ord tuith £, = thak stage with o b indexiL BE = 7 FETT Thre ne ton type of Et : Q.6) | Explain Classification of DS | ~|Theve aro diff. dis. that ame used ty solve diff. ‘math. 4 logical paoblem. il 1 i i { i) di Si i I ae axsangye 524. evdialiy ox {i : a ‘mays slack queuey linked lish il i] Static He: >Tt has a fix memg ed O. ACE Cle"mena ei rags Ho Da ii) Mon-limeaw. dis.t The ds here the data. : elements ave mot placed sequentially on limeaaly ase called mom linear oS + Tn ib) @e can’t toavenseall ‘elements ha single aun only Pea = ex baees 8 gaeiph... + — L __|__ Data Bicuctt i — linear i non _lineax J i _ Static ‘Dyn amie _tree armay aie stack. ae ed_li. Deas Q.3} Difference : jee -| Jt is one of the tos ot the vary. ko ashi is the value-he i ola given tape om = implementations1.0 Vahe ccm he assiqnal|= some operation ed to j - th imect M i he dati