0% found this document useful (0 votes)
5 views19 pages

DSA Assignment 1

The document discusses various data structures, including arrays and their advantages and disadvantages, particularly focusing on fixed size and memory allocation issues. It also covers time complexity in algorithms, explaining best, average, and worst-case scenarios, as well as the importance of understanding these concepts for efficient data processing. Additionally, it touches on primitive data types and their role in programming languages.

Uploaded by

ram2363503070
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
5 views19 pages

DSA Assignment 1

The document discusses various data structures, including arrays and their advantages and disadvantages, particularly focusing on fixed size and memory allocation issues. It also covers time complexity in algorithms, explaining best, average, and worst-case scenarios, as well as the importance of understanding these concepts for efficient data processing. Additionally, it touches on primitive data types and their role in programming languages.

Uploaded by

ram2363503070
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 19
| a Primitive Dato __| jStuctuze] -H€8=ntesey «1. i Float fae thejactes 0} {logical Pointer = is Can. tye _olbtain the 3 3 ny evaluating au . i : ae Fiz in-etabsass pase + (Ci -li)*n + ae z/, Jez oase = 3000 Hee ,fl=3 M22. (iia) s secoro ee |= 3000-41 Rape 20442) co oso + loi 0 «Disadvantage of ariay = wf One <.dis advantage op Uehay is thieg fixed sine sate tel detekmined athe time __o declazation + This fixed Size_cran | lead 40 inept Berhion, ‘Tn memory sag, £ the qmay is sdeclazed later. than, AECESSAAY OF Ei may net “ be—_suttaen + Mose Clement's: need to be te slased” | than _ i ndialty onticiPated Qdd if lonalty 2esizing | ENA S tyPicalls Aequihes Creating news BHAY and Copying Clement!s — chee, tuhich Can obe uinese ent fo} lege arrays, of Frequent madi i [ write character fehic Cs ofS letag ts ( 2} Aniey _stote i elements tha “have same deta__tyfe te ee | = Array ost elements ih) subsequent “memory | location. Aray size shoul Hanne pst I ace Se : #3 eettin tht the caaay with lis 21 ofesaions advuntes__ond — Sanita Zooey 15 a Golection’ of svsasciable “of some data tye known oy Same. Dame pesky | charackesistics:: of — ancy = «| Assay _stoxe elements _that__have __| style. é ligt of elernent, the 0 oF E16 ments, in the list = Value _o4n she a seach in the 1 Seach 1s Si Valve found sak Sol TE CAlag =|). then is = 4 4 write Cseaech fs c unsuccessful”) S..|_LEiniched 1 a aah i Exit. Ae eT a Eten ~ natabion = ee natatiot seit = tnedhemadical Face nl en { ne to descaibe. the £1 me | } time _0%._-sPace “Complexity 0s te zs = indut size — (6) “—>! The merino Fime an alguitim co fake 6 \Fayakable, (a) | Avakage case Hime Complenity-= exPected time Complexity ‘run__on__inpytes plexity ik taxes age ai__ Possible and___thelf Providing a estimation a that by Scenafiios 5) Best case time —-comMlexity. = >} the time rrequied fos. to. based.240n fhe _Mmast iui inPvt Ss! it _*rePresent the lesct _agnount \ of _resoysces needed when the _infut con ditions ase oPbima\s fos thes algoaithm's execution. Woks. case time Comlexiny = b complete, Considefing the most _ | indut-aGcenasiow at Provides an. upleA.-bound m that the, IS. | onoc Phe cosunning> time..¢ eneviring ty will. not exceed time 0%. psa oasite et io Pe ha owes hal and 9 than 1e50.« jo the degree ahs ic a ee pen Pb me “Tine comadlentty = ime. _ComPlexity — 1S measuie Jog the —amourct ok time a} aa\go’sitan. fakes — sun 215 4 — Function, of _the “‘Jength LoF its — snbut— e ” ~ ee = mem. “0% = 3 sce at “the comuut: oF ‘sloxage _stace iran algors mn. _ncequiRes. ZA = shoxage. ea as to solve 2 Problem aE pica — | | S measubed- 1_—teens of how Vt scales — Wit the inbut. ls Size of 7 => Disadvantage = = 2s undezstand and inPlement-- Z “ag well ass unso&eted. fox. _unsaited _data_._—_— = 5) waks oa both! Safeted dele, —_bvt_maihly use D|_seatch time is not unique f_value_is_in DS Te takes. less tine bub Fe valule in_is ef 4oend it. tekes maze time _— Dl Asiihe sizeof dela = inthense the seaxch— dime alco. “lineatty __inckeas@ [upite land. exflain. algoyithm foscbinasey Seakch [This method is used 4o.-find = out element — a ie cae i a elcpent Ibis _yexy _eMPicient meth {element S >} Tt _tixst_—_ComPutes the middle Which index of the = middle Value ss 5 ie = iio as Se hen it ComPasiee 2 value fo be ( p Seebch with middle _ element. af i =>} TE both ceadthes, then fee is Middle: element ig atretusned “Found ~and dk bath doesn't « maices os eae e is divided —_inds two ns “called lowes | aS and vies half ==>) Ahem vagal ins lowe hal 2G Ness than {the inl cae and ti eae ——} th yppes, Ake 9x0 by SS inddlevs element a _. a fe q_wide —Seange F operations (itn —algeritamns Voredtility + Arey —_suPho 5 ee oe a and te Compatible in exation = Thetating troovgh ray e ; Somakt foswasd and — efficient = IpoPtimized _ofesations = rary (anguages —Pxvilide — oPbimized functions + Conition 07034 ofexationS ; like sawting ond Sesathing S| pexay name _sitharesent Hae —addsess of — I stealing eAements stoxed : iW 0 es SS | Two —dimensi ional. aay “sow _—in Beene dlexation —cxse. slowest —— >| Tnsext and delete Ss) seaxching and Guiting ane _fastefe— search 2 ¢sPain sequentall “cecating s _advantsges. ‘and disadvanitsges-- = Hep leceascching 2senc0 ig _used_40 find whee? the esived datas esent [i “cet of data Oh. Not tf jt is * — Picesent tres seneh oPescaing tia “Pyovides_us— it’s Position ____— ecaeatens oy witha SS/_sesential - seaxch CLM ue rela function —_s@thes__*he list {Cont sist “of Ai element _fok the Valve ob Keer a er D ohn SO DOE Le Bs Sk ee eee Concatenation Jement be SePrecent. ats asiay = abhay : Atay = of fata = ditensonal OPerating Accessing ing. ‘Tnsescti mi and_¢loning sg \d_Clo 1g Sand i Dah ati ee ee 3 IN -subeqent Memory mention 1 the — the of} addaes s ya Ww major Owe _OF sun _agsaay with Plain {2a exambl >| Row=.majox —>| if two a ona) _ayzayicelments einge Seqventialty — row _bywow then it ts Called Row _Majo%. — aryey Feamfe:| A 4wo dimensional ormay | Consist of Wo OWS and Himee__Calumns 16 een in P Clvend__ Column! cotvmn2 5 om RowRow [Arsicell A fo) A folC2 ~ (Anas) anna Tannen | eet eam _ColumO__maja% _oxdeg y with “example | iA —> |_Column = _majo% Matas; aL IP tio — dimengional ay elements pp SS bentially column by Column then tk) ig j Called column, Majok Primitive data structuge ake the. QBasic data — _|_tyfes that axe build into the _Pargwaming df language. ee i ee phe Oy 5) They aitinclude ityles ich: a8 0 integeése float) =& } chen ind 4 .sbooleancriet ani dilalah a >| Wen - Primitive __deta shave = af i if — b 1 al, pela The data _structuge that “Take not idikety —| Processed by machine sina ite nO ae — 244 —fmowt as non _Datmifive gata stuctyze —striciute_is a _iyfe of that, cant stake ti ea ee data _stwetrxes— chume 2 FxPlain fuimitive || {and ae date Simucture with | example. 4 —> Date _stauctune = Data —stridctyse 1S 2 es to _Stezing and _ of ee _| i 4 data. in “a ComPuteA_So_thak all it con be sed _eFFicrenty 1 9) Logical = ixelation among the data ttems | Jae Logica) ox mathematical model” of 2 data__ organization is _called «date. Staucture | | 2) Drie —structine means aie Algsithm

You might also like