Scribd
Upload
43 views

Introduction To Datastructure & Basic Terminology

Introduction to Data Structure and Terminology

Uploaded by

R R
Copyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
43 views

Introduction To Datastructure & Basic Terminology

Introduction to Data Structure and Terminology

Uploaded by

R R
Copyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 7
Antroduction to Data Shutcleere ope é& the Logical or mathematical ate P oe janization of dota] | > dn general We can say that Coke ee 5 aaa a eat Seacrest etn pall Shreercheerce = _ Organtead dota + Allewed apercadiens Datastreeee kere fs reaquirced tore pesple .who ceci, eel develop, eae Preqrams of al kind © o. Lg Software “o ore appltccd| ten os ¢ | Baste Teeminslogy — Dete: . c Data cen be defined as an clementare Vales, ore We can Soy the the colleedéon of charcacl ore cymbite- For example? Shidents namejand is Sd eree. the data about he al Group thems: i . “ a eee rere att eee see ae eee ane | Called Gresup, § zhems , oo : For example name of a shadent can Fave Fires? name and the last name» OSGI) > Ghe meaninafel ere processed data’ called: smpormation Now, dts not dafficell to -underef and “that “the! data Neede to be mar vtnisuch away go, that zt can Produce Aamo eae information » | > de preovide an appre priate Cal | Dala type 24m general we can say that Datatype & the def? to the “data Ore we can Cay gfrfell abocet ich type a date. || We aree ne to in compeeterc aaa eee ¢ - | [Patatype isa set of Vales on which Some operadéons | @re percforemed ] . : Par nase a en ageer Be OR {A datatype can be defined as an abeteact concept that defines am inlercna] reepreesentation off data in the mage Rreimilive dale. type Peimitive data gre axe the baste data dupe ef any Programmi that forem the bast ‘untt. Fore dala Tobecbtae defined ty dhe once [A primitive ic pritnary datatype defines howd thi dala & interenall repre dlted "leced and retrieved Frcom the ronda | . y . 1) dhe Basic datatypes are quer: by & ¢ dnteger (int) * character Cchare) * Floaténg. point Numbercs (Float) * Double” preciston Numbers (double) to streecherce the date , > An tol eae datatspe 2 @ preimtlive shat pe that reepreesentl a range of neembere freom =at when n depends pon the neembere one Wered 2p the. computer , cacter (char perecs ue GleD) > Any Symbel Fream cet 0-4 1 A-®,a-x and otherc special @umbst tsa charcachere » 1) to gl Dnt, of bits used fo coneliterte > Moe of the computeres ase aight bits fo represent a ee : > Bhus, 2 which & a56 cRaraclere can be used to represent a fring « he neembere off bit) necessaresy to rapresent @ chardlelere ina. partialar comput ck 2 called the bale etka. Foaling paint Numbers ($loat’) : need" > A Flealing potot numbere considds: of two parcks | . y : ere mantisca A exponent + Gheree aree many Varieties of ieee notations and each ha¥ sndsvidual charcaclereetic. A eee point nember & ,reepreesented ad the exprussion - ey at : mxam: “ wheree y ee n= ts the base (which & Fixed to) ° ceeaicaat exponent : ’ - | Double SS 7 Sixe of a deuble variable és al leact 6Ybits ~ & by les | Double cletaties Variable may cforee a data with a minimum Valut of 14 e-038 unit a dle value of 1-te +035 Note: . dn double data 4 pe ;we can held aumber: with cloicble. [precision Values as compared to float |) Atetnaet “Date tyee_(Hon) I> An abelract, doce type (apt) és defa ined. as a. » mathe tg i model of the data objects that makeup a datatype 28 well | the eae that Sidi on. these obfects. (> ADT ts specification of. log eal and prea yPseresiee of a date type. or Streeeeheeree - OR ag" [ apr arce 13ke usere. defined datalypes which Acfines _Opercatzons on Values using function without | cpecrbging 4 what te there ancide + a Be funclion aa a He opercation : are pevgremed oo ‘Example ~ * Stack ADT A chack eoncicts of elements ina Sequential orederc + Ope rations > of seme type arranged dnilialixe ()- iriltalixing thto be emply Puch ( )- dncerct an element zk the stack PoP() —Delete an element from the Stack is Em, pty) - checks Uf stack ic ana & fal ) - cheer of clack & pal) i a aan aaa 7 De black box “which ‘idee the tnner “thre clare and design of the Gata tape sprcom the citert. 2 Gherce are multzple care to implement a an ADT | Exc A stack ADT can be Smplemented casing” orcays ore linked leete, . > he pragream which usees datecteuderce & called elzent preegrectin« dt hag accecs fo the ABT fre énfercface. |?. dhe program which implements the date ohreercteerce to Known the implementat Zon « ADVANTAGE Lets Preegre Saat so Someone’ ons a ese the shack in the, any, then he can empl) ese puch and pop Opercation withoeet ra d's implementation . Also, 2 th 2a ea the implementation of stack és Changed From’ arc 4o linked Itefy then the elzent ee well wan in ee same gy ‘without ' beng y ea useing Gor) we" olay \juvt ccpvalag. the > ADT Provides abehcaction. which means Pidin details Freom the uesere and 2 és ve vinporctant | because tte doesn’t bother’ abs how that ' Parcticilare thing é& implemented + we ore the user jeu hare to vese that thing’ > She definition of an (apt) mainly Involves two parcts » (2) Deserciplien of the cH gn whch components ace. teclated 4o each othere | @ the opercatione that can be percBercmed on that Aata type: For example + he ant datatype / available in the ¢ : | Ror ea langqac. Provides an implementation ot the “ mathem becal ra list of en caer ere Cdhe Ent datatype can be considered as an. implementatin oh Abelcact Datatype , (INTEGER ADT). Ahr INTEGER APT defines the set of numberes given by (-0-----A,-1 0/42 ~s++ 00) INTEGER ADT also Specifies the operations that can be percforemed on an fokegert nembere ; ” Forrex:- Addition, Subtreacl?on,, melt plication ; divesion, mod ulo divecion - te: reule Jo tell which operca Léon hur is no specif T.) Tis & a design > murat be seepporeted for each (AP data decision - hy Some data cfreeecteerce following sach as ota arce Pacanel| example that will be diccussed 6 > Streacl', tink ut ete a 2 Qor)- Example of an APT | A stack isa cet of fanile reembere cy elements, phere inserction and deletion of an-element és allowed , q as herce atee neembere eth e ing a Sa ee aa From one end, Ramed at top. Ane ned element that joins athe set &¢ Kept ad the top and orl, the element af dhe tp mod postlsen can be te ken at J dn othen wared 10 clock can be defined as a Itt wherce the i elernent that és accecsible & the most mec éncercledY one « ees Specification of STACK ADT & as fotlows - : abstract areas

You might also like