DSD

Unit - 4
Pant
part -B

Ahat is the Use ef trauessal? Explain

about Taavesal çn data stuctud
Capr/May 2022)
2.what is Heap ? ow to build a max
heap and in heap Capa)May 2022)
iT Éxplain. in dotail albout
al t the
iuelred in conucating a qencial
taee into binany tree?(8)
)G) ve the pPael and postfix toxm
the epaessi bn
CNou/pec 022
Copsiucet an. erpaession taee forthe
expilssion Cab*c)+lcd*et1)*g)
Give the outputs wten you apply
eoidesinodes and Dost cidii
tiavessals CNovpec 202

is Tlustsate the ins0ticn and del

epAation pertord in the binany
heap. es)
 wsite a prcgsam to take
and do the following element technique uitoabitoblcwample
i nseit hem into a heap ancd time cemplity (5) (Epx|May 22)
iBild a hap in uneantima Single and doust taiion
Ond ite the Peudocodes
(s) AL tiees
the 2unning fine i Explain wtt.
both algoiithns. multiway search
svesse-cadered ndaandom
inputs. NbemMay 24) The inoadei and taaveAsal
to 3 Explai the signitic ance of vL
thee
Eues cueA bincouy 8e0n ch trees inn bint
ABDE CEG
BEAECG
spectlvely
pestoming naerien and doletion shat would be the
waite the postoacea
Spaisertations e AVL taees to exeute
Laavessal of h binaay tiee 2
Tlusttaate the steps.
L,BI, 10 aDd R-l opeaations ()
ii) Coraides the
&hown Ünén Fig C6)
C6)
foltlauing
Afte insestng
Discusss about
along with
the AyL
its propeAties anol
tice
delet 8 the tree ancl asrant ags witb kuitable exanple
pnfor the aeauied oAations to CNoV/oec 232
 an
Deinc trce taavevsal and utat maintan he tse as balaned one
is the tIoe
taavesal 9Conplexity
Dehine Heap to Capr(ay22)
ta stauctuse
Convert the inhìx expcision.
Ca-B/ Co/E-P) into a pOstfix
S tubat
apeication af (N(D, 22)
4. tohat is the
binany taee ?.(N/b.22)
main paopexty of a
bnay tree? oM22) past -A (2maiks)
t0 uhbat is the
nultu way
acLauage
seauch thee?
The inoadoa and paL order
5lM.22). taavessal st a binas thic and
d beatcq and abdec f
Givo the pOat ciden tiavcas al
aplications a
Give Bome
CAlM.24).
ulti way Seasch thee between
ehat is the dikkerunce 23)
taec depth and height? NID.
tn Data tuctuas
Deline Haap in ahap
he prereatis s
ohat ae (N23)
 Ut- V

Part C2arkz)
ant - B C3nAiks) what ane
Detine GAaph List down Vaiou AepAsenting aq2aph ? Ce22)
GAaph daaveasal algolthms xplain
lwbat do gou you me ant
ny one detail ant b DAG?e 4i92)
Give hotes on Ca)M.229pl
Bhoatest path ain the topological scat CNiD, 22,
atß Define Bhoatest path p2cblemn CNlo22))
Cacblemahoatest path algoitfo lashat is a Complete g2aph and
and it plicatons Ce/M22)
that the manmun Aepeseat Kh graph? CA/M23)
mb2et edqs that a 92aph
namblr
Howoany edas aat mest can a
reitices ian* Chßla. Oihectad Acyaic Gaaph pLaLkus.
ii ) ie the algoaitho to compute ilh numbes Lesticas qacates
lengts cf shortst path-CnD22) than L: AM,23)
plan the raaioUA AepALARNta Find the
-bor. ct 92aph with eNampe in Complete Gaah baxing
detail CND2 CD222
å) Ditfeaentiate dapth BAt 8: Def?ne Conmplete Gsapb ad £inite graph
and bALadth
dotai
fist seosch én. CatD 23)
Does itthen paims
On CUstate the heg ative
B2ach technique (5 LAJM2) algonithn 2
Examine weights ?
the topolngical Aonting,
gaaph G with an
lo ushat a topologicat sadeing
exanple and CApaMay24
Conuplenihy. C3) (o.23)
 hese tuo olg2ithna The adËaceny matix st a faae
+fme oplH2s
LmpleiHes Copluay 2 Vtex aAaph

cupth tissk seaich

-A
R) Ccnstuct a tse and
easch tiee
binasy t0 and binasu A
NiD23)
witt the
dota c5) totiauing
CaprlMay 24)
Ac.g9,45.56,77,319 J45,b,341,Bb.
23 10425,22,9
Disuss ia dtail aiscut the bue
pekoao the deiete cpesatir trausal uitt a suitalte eAample
to deleto the telnuing and explain aicus tAie taavesLat
erstuctd bnasy mithodarit- )
Explain peoth tist tavesal
2ach duetion,&haw the binasy
Ond bin.asy keanch thues itth algpaitm en a gaph ana give
slgoitin
ib' appeieations
Cursenteliments 5.l,8940(b) Dißeuntiate the vuoimm spann
lip Anaiye the best, aweage ond ctand by cing
UOAst cOse time Complexities f the añd Kauskali aljerithin ith
-frbetisn., deletion examples Also mpare the
daletion and 2eaching
 olement in binay taee andl
given postfix
theABe*+D/E
gien.
Conret
expAession ABc* -EQ nto o binawyseanch the Ca)laM24)
pretix and infix expaessions and i) Erplain the concept &f ciride
explain the ÞAocedue indetai .
and Conguer and lustaate hew
Ustat the steps Cs†NID22)
units 4 the satung algoithms hesge
and
Consides the gien undizected quck leming undes divide and
gåaph and applis kcauskals Conques stiatug C5) (AN 24)
Algonithm to ind the nininu i) uste merge SoE and quik
spanning tae Ouustaate the staps. sert algesithma añd demenstaate te.
Cs) CN0D, 22) executien algonitfns en the
elleung elenents
e4 the clementa in
hew the position
each phase of the
eeeutien
bb, 1 2 4 5 4 5 , 2 565909,7
Convost the qiven infix expALssion ii) u0ite the secWssence
AB"e +D/-E into a_postfiz and aelation ot cussire mesqe Sort
postfix output into pafix algorithn and sclve it bo find t tme
exPALibns cund explan he Corhplwxity Also analye the quick
påocedue
the stups.
n delall . Tlustaate Sont aigoithm to Compute the
time conplexi hy ls)
JADrS case
 Conside the given undisected
to what is theSearch mechanism g2aph and apply paims Alqoitho
wOuld he commend t 8earch pind the ninimum spanning
studnts here sudunta ere taee 2 Custaate the stups CalH,23)
OAQaniaed based on theis DOB?
Jistity waite and explain he
alosithm yeua Aecommended 2

[AIN 92)

Diseun in detail _abeut

v topological oacleing buits exanplas -.

CAlD222
Give the tmportanca et shestest
paths in paogranmnaing and explain
theela ét nminimun Bpanning

Boa compasitiie analysa

singly inkud andList, doubly
cçclasly
inked ist dliagran
inkedlst
ggest
with suit able
seme. a p p l i c a t i e n s

andsugst
for ead
(A/M,22)