n-2 Linear Data stYucture)

Data Types CADT)

into +wo! Buit -in

pata ty pei are bro adly clanified
and
data types like int, 4loa4 doubu , long ete.
such as
can perform basic ope rations U1th um

addition, Su bBra ction, division etc: Tu data

I uJer -de fined data type , uie Can be deined

data shructure)
alo ng
with tuir operations . Such
hat a not built - in are known Abstratt

Data hyPe.
whose
Abstact Data Type CADT) i a type of object
b y a set valueJ and
behavioY detined
Set of o perationJ. Tu definiion of ADT only
Lhat "perari0s aje to be per formed but not he

operatiOS will be impumenko. + do e ot

ho data uill
Specity be organiud in memory and
ohat alg orithm) Lsill be wed fr 0Mpumentiy u
"peraions.

proceis o providing only Hhe eflentials and hiding

h details is Kng wn abstraction.

Inkrtau Stack {
Public vold push (srig str);
I| add neu eument qbiract
methods
public shriny pop O ;
eument
 Stack

A Srack is an ordered list in uhich all

and deletionS are made at end

Lalled b
princip! stack aluays Last
itm
put in 4he stak
aLast ln Frt
Ye moved. So stak IS
fo lowsLIfO
principeb
Pop

Repiesentation
of Srackj

used in stack isCal l e d p with

Tu pointr
defaut value-al which is used to

1Helementcof the stack.ta

4 Stack Operaions

Push 0peration

uted to add new elements in t h

first its
the stack. AF Hme of adding
i) ful or not. Pushing 4
chicked if th stack

data ele ment stak

into an already tull poinkr i inotmunt
an called stack Over flo w.

2
2
2

puin Stack oVArftow

 Pop operation
used t delete element from
stack. AF timu of deleion stack 3
checked if i5 empty Deleting from an
Stack it generatu an (alled stack

underfloL" poinkr top is dereMAnted.

lnih al popx!
Slrutk underflo

· Peek operarion
Thil peYahon is used p ele ment
from Stack with our deleting it.

Dipla g operahon
Coh tnh of the stak ADT.
Displays

Ritun tru ir stack 's empty else rchurNN falle.

elie eturni tale.

 stack
Rupresentation 0f a using
Lut u) co nsi der a stack u menCpit
Thii i) cale d as 1h si St acK.
elemen be adde d shoul d
numbeY 0f not
mari mum Sta ck.
exeed

add new ele ment

K we atk mpt to
enconty a stak
byond mar.
you cannot e Moe ele ments
Simi laly
Stackit Dill ie sult in a bayond
Stack
underflow CondiiOn.

algovithms fr Puh and pop

. Push stark, top, marsiu, km):

print
2. Stp stt set StackCtop] = ikm.
3. Set tp = top +1. (incle men)

4. Ruhun

" Popc Stack, top, ik m)i

1. 1f Top O, print un der flow 4 Yenrn

2. Se Set thm Stack Cto p] he

3 Ser op -l. CinremLnr)
ururn

CStack, to iHn):
I. Yehn 1hm
Stack Ctop J.
2. Te yn
 Impumentation of Stack using Lin ked List
can Ypy cJent stack lin ked lisE. In a
stack push and pop operationy an performed at
called Can perfurm Simi tar
operahioS at
Oe end of ligt using hp poinr.
400
dat

20

Start
200 lo 3o0

’ Applicationy of Stack

Some 4pplications of stacks include fo llo wlng:

check for bal ancing of parantusis , bracker etc.
evalua postfix erpeiioh.
. conveYt infix t postfix / prefix foYm.

stoye inhrme diat args and Teturn valso in recursion,

Depth fist Search to find an element fro ma graph.

Aige braic exprei0ny

An
alge braic ekpreiOh a legql Co mbination
operann and operand.
which maHunn a tical operatioh i performed, it can
be a varia bu «y2 . ) oY a constanr (I,4,6. .-).

OperaY Symbo| uhich signifiey an operation,

Algebi aic erpiesion! mag be repiexnKd yiny
3 di ferent no tatBonj : infi, prefix 4 Potfix.
Intx notaion t f0 m of qn
expyesion in
betuen
uhich
two oper ands.
plau operatoY arihmet
(A+0)^ (e-0) (6- (3+ L)* s)^2+ 3)

Pre tix notation t he form

nota ton

its tw
which
operand. Its qlso
c plau
calle
arithti
polöh notaon
tA- abe *4AB-c0

Postfix notahon: t Is for m ot an

expreion 'n bhich plaa

arihmetic
aperator afhy
ib ho operands. ts qlsoC Called
YeveYse polish
nofai on.
63 24 5-243+
abtc t 2/

operator precedene:
consideiing fiu bi nary
operaons : - (subract) Cmulkpy
| cdtvid) A(erpoNnt). have fo lto wiy
o1der of pecedenu:

peraoy Valw
PTecedene
3
hghet
2
neAt highest
Lowey t

knouing all of uje

Conaph, w can qno r.
Stacks
o no ta ion
 (onversion 0f ]nfic to Postfix

algovithm
:

charackY i le tt parantnejis, puh to stack.

2. 1f the charactr is an operand add to the

po stfix expiession,
3. Jf 1he CharahY i an opeYa tor, check wether
Stack ib empty
a) lf Tne Stack
empty I push opr into stack
stack i not empy (hech prioity or opr.
i) lf the piiority ot scanned opera ty > operator
Present op of stack then Push
operarY in o stack.
i) f he priorty ot Scanned opera tor L=
operar Present at pop
operaor romn stack ard add hA post f
expression and 90 shp i)
4. lf charactey i)
righ t paran hesis Tn Pop
all opera br and operandy from Sack unkI it
Yeaches left paran heis and add

5. AfhY 1ading all chara(n,if stack is nor empty

pop and ad d o postfx rprel)ion

folo uing stcpson a given infix ex prc siion

give an equivyalent POsrfix notaion

algebraic * preslon,
 to

Symbol Post6X shirg Stack

R AB ((-C
AB
AB C g n :
A BC t
AB + a j 2
sA B C+
ABC +- D
ABC +-D
7

ABC t -D*EF t

postfix notaDono g i v e h
Tu eguivalent (ett)
algcbraic expression ((A - (B+c)) 3 D)t

is A Bc+- D* EF t T

(onverion of In fjx to prefi x

precedene Tules foy on ver ting an

from infiL to preHx are idenical.

Tu only chqnge fro m postfix conversion S nat we
tu qnd tu
traverse xpreision from right to lett
operaraY is pla(ed behre e oper andy YafLer 1han
atHY f .

0. (onvert prefiz cxpyestion.

Symbol prehe Shing Stack

)

D
)

-(D

I-(0
) - (D

B-(D *)
B - CD )+

A AB-LD
+ A B -(0
(

" Evaluaion POSFEx exprejion

algorithm :
|. when a number iy seen , it i pujhed in o
stack.
2. wh en ope ra or is seen, " perabr is
4pplied ho no two hat q1e po pped
from h stack and he 1ejult )
3
qn CE pTejion is given in poshftx notahon,
is need
this is our obvioui advantage.
 9. Evalu qr po)r fx expressìon : 2
96
Pop 2,io pushg
puh 24 10 =I PwhG

evalua d anseY of 3iuen er presion is .

. Evalu at

Symbol 0perand 1 ° perand 2 va l u Stack

6,5
2 6,S,L
6,s,2i3
2 3 6, s,S
6, S,s, 1
40 6,S,40
6, 45
3 6,45,3
3 647
6 27 2?8
* fueue

Cqn detined
Aqucue an o rdered )t which
enables in sert opea1io ns be aF on
per form cd
end called Rear and delek opera tions be perfomad
at
ano heY end ca lled Front.

Princip u :
Queue is TetHr ed o be as First In

fmr Out Lijt. E olo us FIFO prin tipu.

Rupiesentaqtion
46

TL poin ky) in Queues a1e front and ReaY

wlth iniial value a) -. At
engueu Rear iJ
incvemenKd and durig degucu i front s ne menkd,
opeationS

Enqucue operahon
add a ne w element he Year ed
2ucue. Reay poin kr i) inrCmend.

algoyith m
men,
piint " Qucu is full
exit

Tear = reaY +I
QCrear]= ihm
engeuc

front
 Dequeu operation
Yemove an element
fom
of front pin kr i in Yemenred
algovith m
(front == o) hen noeyve
jt
print 2

else fron6
font]olh
iHm= queue t
it (hont ear) then
Honto 2

rear L
else
ont fyont +}

Lmp or not.
lsEmpy ) : (hecky if

queue, it mpry an d False if

RehrnS
is not empb

data elemnt
peekC) or front): Aquiey
qvailabu at u on t node Lueue

without duleting it.

de leig i
Yearc): ye turns cle ment at Year

This operati on
contain.
ral number

in 4 mem!
Theye 2ueue
aYra

uging one- dimenional

and betkr choic a

fxed
 linked uses do ub lined list
py ovides ueu whose siL can Va ry durig
4nd
procesing.

Representqtion of
queues uJing array
dimensional CI NI, can be used
A on ayay Say
Two poin kys , na mcly
te p1eyenr a 2ueue.
frON and REARI aYe used to indica two

endy of

Inse tion element poinkr REAR wil be

ConJultant and foy deletion tu pointr fhONT
ìll bc 1he (onyultant.

2
queueil emp
ont = YeaY = 0

on O year = (

enucu 2L 33
21 33 1eaY =3
front =o

deyw
fron t= Year =3

* pies entaion Que ues uyiy Lin ked LUt

Queue can be Teprsen hd Lin ked Lit. in a
ueuc data is dele tec
uJing
rom hhe frOn t erd and
Ingey rcd at he YCaY end, We Can per foYm similar
opera Non)
Poinhrs front and reaY or ouY linked 1ucuc impumyntau.,
fr6nt Rear
100

300 3o X
460
100 200 300
 tions oft
’ Applica queue
t jobs to be
H wsed to scheduL
Central Proceoing Unit (cPU ).
Shen mulipu wses Send print joby
printr, eacn printing
qucu. Then ha piinrr prins h
phning
to fst in frs out bas.
job) acco vdi ng
search data
Breadth

to fnd
first
qn element from 9 JYaph. stulun
* Types of queuL
’ Simp qucue Co) Linear Queue
IrAear ShrytuYc which fo ll0 wy
Paricular or der in hich operati on s

performed. order

Inserion qr yor end delehon ar front.

Queue 2ueue in uhid

Apriority quewe is speial
each element i asociahd with a prioriy
ih priority: If eltmenh ith
a(cording
prioiy o(uY hey aYe served according
oYdeY inrh 4ueue. Inserion oCtuYS bayed On
o ( ( r baled
valucs and YeMoval
piorig
elermnt
hiyhsrprloriy
3
 (iYcular Qucue
tiycular in which the insertion
of ne lement i done at 1he vey frst Iocation
ot he 2ueu it the last lo ca Hion of 1he queve
is full.

S4ppo)e have 2ueue o4 n el ements

4hen afkY adding element at te last
in dex staiting w4h
0 index , he nert element will be insetco at
4he very first location of ta queue uhich a)
not posibu in
simpu1inear queue.
Ta basic operations of a circular queue are?
Ingeition : Inserting
resulh in
element in circulqt

queuc
max maximm siu 6 u ajiayt

* Deleion : Deleting an element from a circulay

queue Yesult in Front = CEront tI) °/" max

max is 4e marim Um a17ay
· Traverie : Displaging the elemenh ot 4 circulaY 9

Queue i n Front= ReaY= o,

CIrculaY emphy
cir cul aY Queues can

1.
Singls tin kLd list
2 boubly linkud li3t
3. Arags
alorithm in a cirCulqr
toy engueue
(front=(ear 41) /marsiu )
2ueue over floLJ

taku value
if (front == -1)
front= Year o
btaL 4cue CyearJ = i m
else Koite
YeaY = (rear +1) /max-siu)
2ueue Ciear J = itcm

algorithm for dequeue in a CiYCular

it (tront = = -1)
wrik ucue is nder flo

elsehid
ik m
A4ins

else
front = (hont t )/max-si

qbbrevakd
A deubu-ended queue Cdequeue, of hn
t gencrqlug 4
deue pIonouned deck) 4dded b
which - Can be
queue , for elemens
Chead) or
YemOved from erthar u front
back C4ai)
It is qlso Called a head - tail lin ke d
 add add
Clement eleme

2S So 160 121 200

Frant
umove umoL
elemenf element

Tue are tuo type 0Y Vaiations

of dege. Tuy ax:
Input Rujtrichd Dequ (IAD)! 1+ is a deque,
which allowy inserion qt end but allo u
deltony at both

dlele
front
Outpur Restrictd Dege (ORD): |F i) a deque,
ohich alo) deletion end but allows
insertioN at both ends of
inert

front
Operatio nJ:
Deq ue
" Ingert- front () - ujed to push an elemnr ho ta
front deyue.

reaY
tronr

" insert- back ) : uwed b push an elumenr

kront
 34
YeAY
front
back
frum
elcmn qn po used C): back umoL-
23
S
from . qpe hae fyont
element an pop Uled front(0: move- u