0% found this document useful (0 votes)
2 views17 pages

Stack&Queue

The document discusses the concepts and implementations of stacks and queues, including operations such as push, pop, enqueue, and dequeue. It explains the Last In First Out (LIFO) principle for stacks and the First In First Out (FIFO) principle for queues, along with potential overflow issues. Additionally, it includes algorithms and code snippets for managing these data structures in programming.

Uploaded by

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

Stack&Queue

The document discusses the concepts and implementations of stacks and queues, including operations such as push, pop, enqueue, and dequeue. It explains the Last In First Out (LIFO) principle for stacks and the First In First Out (FIFO) principle for queues, along with potential overflow issues. Additionally, it includes algorithms and code snippets for managing these data structures in programming.

Uploaded by

pvsatvika
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Stack

Data: Staek is an ovdeud (is6 witk the uuiihion fhat ehmunts

Con be addd ov olbd from only One und f he st tiimud


'st txmud

top fatack. (Tos/ Top)


Paineip LIFO

tAings het ents lask a n be taken fhst


'st euments taf a Qccunnd in LIro ovdu

Aaek - imphmuntd uing aoy or linked li'st


0ata ay narnic

Opsaton inue an ehmunt -

PUsH
culi an elurunt - POP

has a poini cald ToS hat kups katk last elrunt

bottom is hiet seald


PUSH ingest an tlumant at he t
PoP ag. ho nput,
elumunf at top mosgts daletad
naf actua
b ony
poin pone
Rtack Owflow 2 lnclus/loco
an thment tying to oulh an aumun
try to inwt
In an em
ty Atack.
in stade uwheh is aeady
a

linkad list -

dynamic
Implmuntation 2 c0ays anay- S tane Csize is ired)

Anay Implumunta hon


:

Atoru only a d 5 dafa valus


no

say /4fack) u
i
Kize
rus hoch ovellovo
no p a u

15 256
op Tot- 2-OO
hot
5Inet ys
[Link] so cultbd TDsD O
bvtuovttn
Pop 0hun next ine
ToS-/

s dont
9Irt 2)3
12-7net

Aoadun lfun.) namu Oay

Aeadune TOS
PUSHstack, n, ihm, p)
(top == h-1) Hen OMay
p inf ( lack Oveylow')

STOP
lu
top top+
utack L top]= tm Ch be inwtd)
3ToPend
RDCAd PoP (stack , top)
top - - ) thun

printAtackundeplow

hmtatk [ top] we heded fke

op-ap- ttn &emovcd


end
tindude stdioh>
#include conio h>
dine N to N=
void Push ) ;
void Pop C); unc uclasa hon
voidl dlisplayC);
Int stack[NJ, top= -l, ehmant VOsiablu au global (so thaF
Void main l) Puncs an Ue)

int ch
clo

printfC"n1 Tneut ln 2. Daleta \n s [Link] n ");


pYintC"n Entu youw Choie );
Acanf C/d", Peh);
Swich th)
stoak C
Can stock (a]
Push t); break, ctauk
Ca 2 stack (o]
Pop ); bvzak;
thp
COR3
disployt) ; bruak
ch a
COn
erit (o); bzok,

dsloult
Dvintf ("nvalil anty ),
whte Coh!-4);
getoh C);
void Push C()

Cop = = N-1)

prihnt"\n Aoek isFall ");


elue

print (\n Enluy olemunt


canf"d &sumurt)
top+
stack [top] elumunt
3
vod op )

top= = -)
=

prin ("\n Atatk is Empy ");

/elumurt =Stackltop]/pvin ("n Ehument dluid is d', dhm

volddisplay()
nt i

f (top==-
þrintf ("n|n Atack is mphy ");
lact-in aumunt prinadS
OY (r-top; Ís=o} -)
printf ("\n d', stack();
. t ophognarm fo Atvwue a
abing aing stack
2Chuek for statks dlantoo
4- 2 Stoche a sing aany
Agovithn to chuk for balanud pananhei in an tpre

Dedane a stak (ehasaita tock) s


Tnavoue erpunior (ihput Afing)
wwent ehar a stausng bnacket (C,t, ) , fkan push
ito stac
f He munt ohas a claing bradket C,1.3,tken
pop rom Stak efthe pepped th anada temarhing stanting
bAat hut hun balnud eu banenthus ase not balanea

seanning all chau rom erp, a n is any


kononud fund ? t sfacl or f he statk fs hot emply, fhun HR

eap Ruunion unbolanud

2amp CA-8)- Cc-[b+E])?

Mareh pop
pop balaned
popP march

marrk

push maf
Duk pu Pe pul
pop
Pop

fack i tmpy
Co Whuh ezp. / compltc
9 a
c -

[D+E]) ?
Puch Pusk PoP pop

c.0:,)
-math S,)-do nokmarol
Pakanthw hof balanud

23/9

nprus iong
4

0pUands
OpKatDY

3pes orotafon or mohumaoal eyp

Prulis (polith nofaon )


Postf (Lvue polish)
nfin operar ie prun b/w he opoaonols A+8

l'ochn - opuatov is writen ofts m bpesand AB+

Paul bpxabr 1s balore H opuands + AB

Chenatorc
bY hig pcaoenu

Conwioh n i r to

Tnli A +(B *c)


ost
A+ 6 tc) A+CB*c)
8*C
A+ BCt Bc*
A+BC
+ABC
ABC+ how This fally
's a singl
opianod

A+ l8- C/p) -E Ine


Postli A+ (B-CD/) -E
A+BCD- - E
(uft vight)
ABCD/-+ -E
ABCD/-+E-
PfPr A +(B-/CD)-F

A+-B/eD -E
+A-B/CD -E
-+A-B/cDE

Ony ostf Pefi


fosis o &uul for tompiles
abt bpsafor prece dence
Cotrpilu doeent hau o
cas

rucess aA evalualt brackus are


o inix þhLcedunu buls oa
these
most compile
ue postin)

innis convaiolo p/posth at tompiu timu, g duaing runtme,


Calulakoru ae dore in bostia/pruli
aok
4/9
onvosion using
Algorithm for nfo ost
shatk.
nia an tmpy
add )'% end f inpuk sing
Pash ''ono Statk
3 a n th input sh ehas by chau om o righ
adl t o P (oupu dring
trounlruad,
a n puand t fo tke a ta
entwun laead, pok
Sfa uft paunthe
6 an optsay fo enountud, tin
stack is opening pardnhusa, puh
it
he top
prioriny han
opuator at ros hos highu or samt

e ewnt opuator, pop opuaby from th sloekg ado

o Dutput sbing, Yeptaf Jor tuy operatr in stock

puwh h cuwuht opraor Onro e atk

2noun u d, pop fe opaator


ebaing)
'

i9R pounthe )
vom stadk cdd m o vuu stuing unb6l an opening paronkei
enowned Pop& discond t ojp enirg pananfhr

A B C/D) -F

Tnput st A68E7DFED
2

owpy stoek 7OS

TOS
2

3 add ASP.
Add opuahor o staule
7CCT 70S

pOp

12 C
po drscad TDS
Co
Sam
pop

6 pop
7 empy top
pop g discand

-+EE1
Output etng, P.A/8 c 8 (o 1
2 19 15 6
6

/P ABCD/-+E -
S20 1 2 4 - 7 -
tvaluchon

:Add 1)b nd inputeap

Smpy

5/20

4
PoA
5 s/20nly [Link] B op A l2/4 3
pop 8 B-A 20- 3 1 2
15 203P o p A
Pop B
9 5/77
A
Pop B
B bp A S 5+7 =22

22
l2 27
13

pop A
Pop B
B B p- A > 22-7 = 15
uu frontIT
a a r u t is insentad from ( end-wea.
ehment dultd rom othu end.
for end ql quue

follous FIFO baginning of quws


elument tnsesid first is semovtd fir

wwd tn Opeuahng Aycume)

Cincestion)
Calehon) 20
oENQUEUE
DEQVEVE AL3] A4) Reo
A[ A[2)
Ato)
front

Openahon
enguul) - add an dumnt at end 9uu
ull - ovnflovo. uas + ) (elh sFtt|

augue) - dtlias ohmunt rom beginnuing of 9ueu 9 u r


Ennpyundisler Cfront+ 1

ropy quuum ront Rioa -


In umentronr Reos o
fovalone Pmuet poinf eumen
e l a = -I -Cur canpufonm
Tnd elnan F O , R-i
dnluhon.
F1, R=1
Cmpy

Algorihm
enquuul)
Chuk i queut e full

qmm is ul, prin "Puum orulow'


3 ihtumunt Reon by
4AMian ww [Reoni ekmun
CuguuulO
. Chuth i quaue is
emphy
empy, print Quuu unflow"
3.
lopy he elment af Ra ront h quuu o Som UmporM

vasiablh, TEMP: 9uue[ front


ront
5in mp delt 1

void enQuuuu lint daa)

LOA == Size - fron-o VLas 2

2 =3

prin (Ouu is full")

Cront-1)
fvont =0 whun inathng elmert

Quw [rros = data ;

vbid dQuwu C)

trontr -1)
pYin("Quu tmpky ");
eu

print C Deud: 4d", 9uue lfront7)


vontt
tohun lout
(ront> suoa) / h make i -(emply)
elhment is ehletd
ront veon -
Size =5

n a t A ,B, C, D, E,E one by oru

Dilua
Dalli
Daka
Tnsut G
Innt H

Erapy uuu
FR:-

[o)- A
A
Fa o R: o

F.o R: 2

[a) - D
5

F=o
R:3
4) E

FFo R

prinb ueut le hall


(5 -1)
tront== -1 - Fale

R H baguuud: A

hot ol letd, juct front k ehang.d maintah gua ?

1,1o TEDE
daawbad of
l1. 4 (5-1) Tru >

G,H- can'h be inustd > eun fheugh 3 ve Cmply


n u l a s guuu insuod.

htng can be dons ut thulliunt fo lang Quw


more hm Cohau
VaAionory In uw

Civulau quuut
double andud quaue (- Dihuua)
priDrity 9ww

Citulas 9ueu
DHo s0s vo only whuh all R locations as fd
May Size 5

assummo Plo)q1)
a

Algorite
Ins aing an eumunt
front = = (vea 41) / marSize)

Run '6uu Oruflow et

YAaA (Lon t 1) maxSiz


heo] valu
f front=
ront = o
end
Duhng an elkmen

T(front-1)
fun Quu Unduflag
hen exit
erit
eu
alu [front]
dua ing laut elu
Cfhont = Mas)
then ront -lreas =-
=

ee
nt = front +1) mar Size
Tnsest la
-= (-).s )==D F
Yeo 1 4 ) / s reas Fo

freat - 7
front o
Truest
Co41)s D = = l > F

eue YLOR Co)5 rear =


el
b

Tnsest 'c
O ==2 F
1 ) /5
VLOR(1)5- ALOs 2

-1 F
fron 2

Dlt F
ront== -
Valu
/o
ebe vola Q[fron
2 F
1vont- = Teos
1s hont -
vont ont 41) /morSiz
Dalut

C valu =Q] valu


=2
ela y 41s2 front 2
Irust'd
2 (2 41) 5 2 3 F

e Yeos(2 +))s Yeas3

Traunt e
2==(341) s 2 =h F Y

cue reon =
(3)5

2E= (h+)/5 > 2 = e o-s F

e e Yeo Ch)75 reos =o

Insut
2 2 o 41) /c - 2=
=l-s F

ek Aeou o+1)s Reos =)

(1+)/5 2 2 7
2 =

Statk Ovmflow

Diu encud quene infes end, deluh bo ence


/p usaichon-iaut frovn en c delst only rom I end
o e a ' -baginning -0

d
Incuf d rom en

t fvom beginnir
is ro end
TST algovilma

engitradad

Psiovity Qu

You might also like