Stock

A stack i a ut o elama un wue an elomot

may be Uieutad o dalcted only at ona end,
Callod u top othe stadk
Two bawc opeuationa
Puah

2 Pop
Stack aed opLOceMng o data whan Ceda
wtid
Stups ok
Staps the puocenng must be poatpoved
Otes ondutions aHa ulked
Aay Mop aJutatio n o skack-
marstk = ma umbe o elamand i a c k
2 Top o emypy tack (wndu kow)
Top maxi k ull afack ( u e ou)

AlgePush ( Stack, top , maxstk, tam)

Stp I - nutializalton
Stp T Top ma xstk,
and Reltun
t n pnt OUetow
Stp T Set tol = op + Luueae tte top by1)

Set otack[topJ: tam

&tap
nseut e tem at no top poaion]
Stup exut
 Itam)
Algo Pop (stack, toP,
Sap I - 4nitialization
Top =o, t h
Stp T
Unduow and sugtun
punt
Stup L - Sot Itam stock Tob
Lamgn ToP elamant to m

Stp St top= kop -1 Lclackaaue top by J

muumuaing ovulow
> Paluah Notatioh
Auhmatic expuOnLON
Conatat and opeicdiow

PMLCedance Eaponadialion (t)

22 mulpucation (*) and divaLon/)
33 Addution(t) ad awhbaction(-)

polah noiatuon

In A+B)
2 Phe +AB poluah noiation
Rese pouah nolation
8 post AB+
 Evauuaion ot
Evaluatton Reweuse
ot 0,pouah nolaion
Evaluat posthx expuomion
Sp I 3nitauauon
Stup L- add a ugt
panethuais"at a end
P
Stup TL Scan auh motic penion P om t
to ugs ad
Rapeat staps u and 5
eadh amant
OPwntil e nd
PCntou encotued
Sop lu an
opeand» is enuowdued , put ut
n stacle

Sapv an opeiato nowtued, bw

a) Romove bu two top elaments of stoa ck,
oe A u top lament and B u
He nort to op elament
b.) eualuallu BA
C) place J yoault ofb) back on stack
LEnd ik
LEnd o stap 2 Loo
Step Di Set value equal to u lop elomunt on
Stack

tap it- Eut

Example P 5, 6,2, t, * , 12, 4,/,-
(3+)
Inx to post
A+(B C - (D/E 1 F)*G ) * H

Puocede-
add ut ad ugt paxerhoaus to e
epuonLOn
add o expuonion avd
opeiand opeiat
to aock
3 an opeadto unoutked w

i top ok u STack obeot have

Same
hugen pHace dnce Uhat psent opea
a pop huguu pecednce
Opuate and pudh DDu pacedun ce
Opua
* s e push puueut opeicto oto stack.
a t pauadhwiacouutu ed, push
te e tack
uglt pa@niau J nouutosed, pop

Opuatiy pOle Lgin iin

Stock . Lowti ed .
pop E patdwai
 (A+ (Gxc- (D /e 1F )* Ga) * H)
Sruck
expmOn

(+ P
C+
(+0 AB
(+(*
(+* A BC
(+( ABC*
(+(- ABC
(+(- A BC+D

(+(- ABC+D
E (+(-C/ ABC +DE
(+(-/ ABCDE
C+-C/ ABC DEE

(+( ABCDEF/
(+(-* A BCDE F /
(+(- ABC DE F T/CG

(+ ABC DEFT/G*
ABC DEFG *
H A BC * DE F /G* - H

Empy ABC * DEF / G*- H* *

posty epnmOn
E
 Algoutm to po.lueh notaluon :

Pouah (@,P)
= nH notalion o epemion
P
po sth notatioon
o expuOMLO (equwalnt|
Stop 1-3nialu zatton
Stup 2 Pua " onto tock and add o Bio
end o
Sp 3 Scan om ut ugtut and Repeat
Stup u to t {e eadh element ot Q t i l
ofack empty
Sp - n opuand enowdued add t toP
Sip 5 a t
a pathes inoudued,puok
t to otack
du:
Sap 6 opaat e o wwned
a) Rapeotudy pop om tack und add b
P each opaois (on u top ot u sack)
oc hos ue Same ugue puacednce

b)odd t dock

End o audue
e n Lounlied to
STap t . a ught paothoau
 a) Rapeotadly pop om ooack and add P
eadh Obude (on a 1op o Sfack ) wtil
aut paay thoai inowdued
bRemDDe ho l t pasouthuu. (do not add
al ugut pauthas to P)
LEnd ot ouhue3
LEnd Oatop 3 Loop
Stop 8- Eit
Apbi cabon ok otack
OuckDut
4, 33, 11 55, 77, 90, uo, 60, 99, 22, 88 66

piwot

S t a n om
k klavgeL etamuut and ghE
Smallel elamuut

22, 33,I 65,77,9o, 4o, 60, 99, 98, 66

LCuuge Om t

2 2 , 33, 11,9, +1,90, uo, 60, q9, SS, 8, 66

Smalluom gut
22, 33, 1, (ud, 71 ,9o,, 60, 99, ST, S8, 46.
awgeom lult
22, 33, I1, u0, , 0, FH, 60, 99, 5 , 88 ,66
 pas Puwot = uu

Pouion

22, 33 , I , yo, q4), 90, +}, 6o, 99, 55, 88,66

Puoot
Beeond
AblAt Aubloe
algouim o Quick a0ut L dividad uto oo
u b alg0utm

ick u Scan u elomb om akt

and uglut and

puoPo oE alamout
2. uuksou y e duwAcde aay n
oubaa togt t i ADHDd AubHays.

Quuek algo
algosut)m- uick (A, N, BEG, END, LOC)
A quwen au0y
N unber o etomezus aea
BEG begyo beguug ot aay
END ndug o ay
elment
LOC ocalion o pwot
pwot AlLo
 SCap Initauzulion
Set LET BEG RIGH T END and
LOC= 3EG
Skp 2- Scan om uguut to uk

a)Rapeat ohil A[LocI < ARIOHTand

LOC RIGHT
RIGHT= RIGHT-1
End ok Loop3
b LOC = RIGHT, hu Rg Rguhn
C-) ALOC> A[RIGH, bu
nbihange A LLOC and ATRLHI]

TEMP ALOC]
ALLOCJ A RIGTHT
ATRIGHT- TEMP
ii) Set LOC RIGiHT
i) Guo to sap 3
LEnd o totudu]
St 3' SCOnom u To ught

a) Rupeat Lohis A Letd ALLoc] cnd

LEPr LOC
LEFT LEFT +
End ok Loop]
b) LOC =
LEFT , tho atuan
 C)ALLEFTO> ALLO, tho
i)lnthange ATLEFT and A[oc
TEMP ALLOC
ALLOC = A[LEFT
ATLEFD = TEMP
Set LOC LEFT

1)) Guo to Stup 2

LEnd o atutue]
agouthm qusk ut
Stup 1- ntiau zaton
TOP NULL
SAD 2 Pua boundau COnduutiony onen Nz2

NI, tho
ToP fDP +|
LOWERDI3

UPPER 1 = N

Stop 3 Popeat otop u t ohile ToPE NULL

Stp - Pop Qubliat om tack

Sat BEG LOwER [TOP
END UPPER LToP

TOP TOP -
 Stop 5- Call uiek (A, N, BEG, END, LOC)
Sap 6 LPuah ut aubluot onto atack whn t
has 2 elamunts.J
0 moue

BEG< LOC-1, hn
TOP TP +),
LOWEREOP] BEG
UPPER LToP) LO-1
LEnd o i autuu)
Stap 7- LPuah wout uhuat uto dack whan t
has 2 moe elamanb
LoC + < END w
ToP TOP +1,
LOWER CTOPJ = LOc +1,
UPPERLTOP ND.
LEnd ok duduel
LEnd o atup 3 loop]
Aap8 Eut
Complaxuty o quck 6out
Best ad weuage COse
OCLogn)
wOust Cse On)
Reuwaion A module wction to call tely
Auntion a either calls ts e
duuctly a Calls
cals
akndion b a t un un calls e
oiqinal
n ton o.
to make u e not LOntdnue
undal1ndely,To Un
a ecusawe puo ceduwe must hawe theolouD ug
wo popedies
The must be a base utua, owhch
e puocedue doe not cal ek
Each u n iE
Q thu puocedue does call Usek,
mst be loseC to u base Cudeua

Facto uol withou aUaLon

Algo Fa ctoual (Fact, N)

Foct N
Sp i Snubalizalon
Buun 3et Fact= | and Retun
N= O
Stup 2-
Stap 3: Set Fac 1

Stp Repeat ltw to N

st Fact i * Fact.
LEnd o Loop]
tep 5 Retun
 Factoucil uamg RewkaLon -

Factoual (Fact, N)
Step nüauzation
Stup 2
Sap i N=O,1 Set Fact- I and Retuun

Stap 3 Call Fadoual (Fact,N-1)

Stap : Set Fact -N*Fact

Stap 5: Reun

Fbonnau Suues.-
C) n-o n-l, t U Fn =n

b) n>, t n Fib(n) =Fib (n-1) + Fub(n-)

Fbonaco (n)
Stup l- Snitiauzatuon
Step 2 iN-0 N=l set Fbonau (N)= N
Ond Retuun
Step 3 Set Fubonatu (n) = Fubonacu (n- ) t

Ftbonacu (n-2)
Atup. Retun
Duide and onque may be uewed cs OCUAwe
PuOceduue.
 Ackmann Funtion-
Claoic OCUAwe wcuo n nd Dwido

Conque appuach
Deknuion 0) m-o, bwn A(m,n) =n+I
b ) m t o byt n-o, thon A(m,n) = A(m-1, )

C)4mto but nto,then Am,n) =A(m-, A(m, n-))

lowe ok Hanoi
Towe(N-I, Beg, BrdAux)
ouD (N, -Towe(1, Beg, Auz,End)
3 Auz, End)
Beg,
BeBe nd
Towe(N-1, Aux, B, nd)
N 3, Be9-A, Aux= B, End C
Towudi,A, BO
Towa2,A,C,B) A 8

Towea (1,E,A B)
Towe(3,A,B,) AE
TOwe1,B, C, A)

Touwe (2,8,A,C)
Towe (1, A, B.C)

AC, A B, C B, ApB BA,8>c. A C

Ago- Tow (N, Beg, Auz, Gnd)
N
umber o dus
Stap Snubauzalion
Sup2 NI, wn
a) Out Beg End
b-) Retun
LEnd o abuctue)
Stap 3-[Move N-I duks om peg Beg to peg Aux
Cal Tooea[N-I, Beg, End, Auz)
Shp u- ut Beq> End.
ap 5:- [Move diuk hom peg Auz peg brd
N-i

Call Too (N-1, Aux, Beg, 5nd)

Stap G- Retuan
 Queues
A queue a wneCu wt un ohuch elaments
Can be daluhd only e end callid kot and
can be uatnd only one end cculled ma
uaueis a FIFO u c i u e

Raposenlation ok queue
Queue Loiul be mcLudad uaun9 neau Ay
wth wo pOtus Fuont and Roa
Loonew dn elamente addad D t queue,

u value oRaa mualed b

oheeweu an elamant u HOmoved o m e

queue, e Ualua
ok Fuont u Ceed by
Fuont Fuont+1

Full
Fuont
SHt n a queue -
i n s t (Queue , N, Fuobt uua , Lm)

Atnp 1 Snialuzaton
Atup 2 eck queue iu alady u l
 Hbnt=l and Roal =N, O
Fuont=
ROa+I, Bun
out Ovukouod and Relun
Stop 3- Fund Ualues o Rec
Fuont - Nul, bn lqueue u empy
Set Fuont I vd Roa = I
Ee Raau N, bwn;
Sot Roak= |
Ese
Set Reas = Raas +
LEnd okobutue
Stup 4- Set Queue tom LRaal
Snut naw elamant
Qtop 5 Roun
Delo twn om a queue
Ago- Deui (Queue, N, Fuuont, Roau, a )
AnutialUzaton
Atap 2 LCheck queue empy
Ik Fuont =Nuu, un wuh Undulou
andl Ratuan
 Akep 3: Set um ueue LFuont
&tep und nuo valua Fuont
Ik Fuont = Raak, bwn
Lonly one tam Un queue
Sut Fuont Null and
Roal Null
Ese Fuont =N , tan
Sot Fuont =

EUse
Set Fuont =Fuont +|
LEnd o otucaue|
tap 5 Reiu
Cucula Queue
Suouns que u ul l quew u Paiall

A u l a l queue, by daindon, a queue

in o u c iw elomant next o l last

eloment is tu t eloment

Agouthm meut in UHulau queue

Qtop Sntializabion
Stop 2 k ua pou to t nd o
queue bn o to tap 3, ele goto
dop
Stop 3:-Let Roa value - O
Stop 4-mouase he a0M value
by
Stap 5 k Ont
kont and Ma u a
pouus pout
at bu oma
place n De queue hd
bat pla e hal a nct nulU value,
bwn queue u oveuklo, n go to
otap + else
goto atap 6
Stop 6 Roa Roa+
ueue Raa ltam

Stap 4 Eut
Deques A deqe a de quaue u double ended

quee i a wacu Jist in whu elamenti Cau

be
be added e duldlad at uth end but not u
Yucdl
t and Righl ae wo pouis ohu pout
to tua eabds ok deque
Snput tasiuelad daque i a digue ,ouc
allows Ustions at only ue endo u
 yt but allowS daldiions at bot ends ok the
ust
Output-uestbicnd doque Ua dque whd
alows daletions at only Oa ehd
o b t
but allows uweutions at both ends
ut
o e Lut
Ou
Compucation may ause at
obelo0
0 and uwndlDo
Piputy Queues A
puuouy
queue is a oladon o
elamenls Quch that eadh elamant has
aratL awided
PuOuty and delute and puocem accoduwng to wuwles
3
Hgbu punu elaut Þuocened kut
2 Same p elamanb
uouby aue bo cesed acLeding to
hU du ok
A puotolype ok a
puouty queLe is
timishaLwg
matai a
puouty queue u mamOsuy e
a
apaualí queen k eadh lwdl ok
pLauuty
 nked sE
In awUG, data auo uulatod by phyucal
adduom
b
ok memou, not by t h values
Inset and dal ae
No addiutional spoce upnawe
aihy plunuidad
A nked ust, O One-Oay wst, is a mecu
Co ction data elament, callld ods, ohee
weaL oide s guwwn by
maans ok poudus
Eodh node is dwided to o
pau
HsE paut » data dd
secend pat unk held
a s t poudu vaiable_Staut name) tontOUE
te addam o u kwst node U e st
The potu ok tu last node cOndaiss a speual
Value called ba nul Lohuch i any
pOunu
nvalic adduen
T nked wt
a
A A Linked sE in memoy otoad wean akka0
ot ataut poinlu poutng to
Inko aund wnk
In
k t elamant
Staut
Algo- Tuavag a wked st

st = wuked UsE
Puocen obeaation t puem
ptt pout
Stp 4nutafizaion
SEp 2 Set PTR =START

Snutialite poutu PTR

Stop 3 Repeat Stop yand 5 okule PTR#NULL
Stap u - Apply Puoc es to nke LPTRI
Stop 5 Set PTR LINK[PTR
PTR ouo pouts to tu naxt nodeJ

LEnd o Stap 2 Loop]

Stap 6 Exut
wnecu ay ahd wked wt naweuang ue
Sumula om e acE uat both ae wwsu
obuctues whuwh Contain a natunal e a

idlang ok eame
Lownt D umbe ol amenb in uked u t
Cowt (np wk Staut, num)
 Sp 1- nubaization
Stup 2- Sat Num o
bauzes touts
Stp 3- Set
PTR STaut ru.bauze pouts)
Stup 4- Rapeat Stp 5 and 6 while
PTRE NUUL
Stup 5- Sat Num Num +
gtop 6 Sot PTR k [PTRJ
LEnd ok aap3
Loop]
Stop 1 Rotiun
Saaudwg a wked uwt
Seaueh tam in wked ut
ust wwoted

AMgo Seauch (Ino, wnk , Staut, itam , Lac)

Shp 1- dntiaization
Step 2 Set Pt Staut
Step 3- Repeat stp whule Pbu t Null
Stap 4- Ilam mo' tptj, bun
Sot Loc Pbe, and Ext
elo Uust
Sot P - wk [ptk)
Ld o Step 3 Loop]
 Stup 5 Secuech wnsucemul
Set LoC - null
Stop 6 bxit
Compleby o alg0
Saum a3 Lweau eaudh
weist cose OCn)

Auuage CCue o /2)

wt i A0uid
Loc)
AMgo- SRCHSL(ko, rk,ofant,
um ,

Step 1- Snutiauzalüon
Sap 2 - Sor p : tast

Sup 3 Ropeat ottp u while ptut nuil

3 tom 1noCpb, tun

Sat pte = i k Cptbe

Lp now pouui to noxt nodel

ELse i ltam- lnho Lpb, un:

&at Loc= p
L a h uccemul]
e
Cot Loc- nud, ad Exik
 LEnd
d obo abuctu)
End o tap 3 Loop]
Stap S Loc nu
Stup 6
Bun auy eaxch
algo Can not be
appued
Homalu allocation Gtabage
a
colubion
Spetial UAt u mwtauned
phich cOnaud
Ok uuec memou cells
Ths wt contaiu own poutu, u callud
03
Owaiul t
e obuag ust eepooL
1auha qR ollhction
Ummedu atoly oueut bu space uto tu ul
otouage st atou delution
puodically toloct au thi dltnd pae orto
hee otouoge lut, known as ganbog
Collaction.
Giauboge CoUluction has uwo staps:
un tmoug all ust, togag CLUXAtly
uaug CoUs
22 Couct al wtogRd ulls uto ee spate.
uolow and wdu How
Ove How Auail =Nuull, Whdakoue staut =Null