Date

Page
ssianmcnt-2 DAO

’methemeiclProofJc muthemtical techhiauec

calgxathmSeatisfies its
to demnstxete thet thc
Sfecifieation,
Iovchvc 0cesahin) Show thut he uaithm
nd thet if
ihput, it also ooHs fes he
hert infut
3Lop inveacnts i- Prove thct cestuin Poperties
Cne PaeSCXVE] hUheuch itetion of a lool
Testina Cnduct ex ensive testinA Coveina
Vra iovS infut Cuses p Auin Confidence in the
alâoithm's CoeN ctness.
-2 whut is c lihecg dehe SEXuche ?
A lineca detee Soche is cA te SBoctue
ih whch elements rge ogcANgo Sealenti
cd ech element hes a Vni9ve
PoedecesssK cnd Sucesso8 e cePt PoX the
Pixst cd ksH elemernts. CcnPles' inclvde
osags, inked lists, Slucks Cnd ueves.

what is a faulweighied áxPhcnd diected

Comected
nts Ru fionshils betweern Pais of obiects.
’weiahted Gafhi- A weiFhted ouph is c Ci
8aPh in which ecch edge is ss Sed
mmeZic) Vulve hat deloesentS a ceXtùn
9Vuntitd .
which esaes huye a d ie ction, ndicatina e Ohe
Comectioh between nodes.
 Date
Page

what is a Fee ? GiVe con emm Ple:

Atoee is c4 bieXASchicul datea Sfouchuse
Comfosd of hodes Connected b edes with
Ca Sinale 0ct hode amd evexd othes node
hAving c UniAue roent. ltdo eSh t ontin

ile stskern hierchd

Q-S wht is Absct Dtu rdpe ? Eplein.
hi h-level
Hbstc Detc tpe is_ u ofetions
descxiPion ofc Set of hut
SUPRSot without
Sfecifdin9 he impiemen tetion derls.t
defines whet ofesations Cun be peofboned
on the de tey cmdwhet the behayio
of these opestions sbovld be.

whut iS wS , best cmd ayeTufe-Ccse

efficiene ? Eplin.
wosst- Ccase i Desczibes the meaimym
time on SPue ComPleritd that cn algcoi
thm oevideS too md input.

Best -Cas i- ePesents the ainimum time

ComPleritd thet an alAo rithm
Beviges fos cu SPecific inPut
Avetue -Cese'- RepDe SeTts the ex Pected
tine co 5Puce ComPleTtd oeo
distoibut jon f /nPuts.
 Date
Page

agite motes an A5dmP totic Natcttion.

PstnPtotic noteations C Bia o, Omegc Ihete
descoib theliaitina behavio of cu functioh
CS itS int
cPPOuchesinfinitd
Bia oCo) - UPRes bndProyidescn csd
mPtoticPPo imt on theg0wth of
Bnchion.
amegc CS)-lawex beundPoovides cn
us mptotic louwes limit on the 90wth

thetc (O) tight bound desczsibeS both the

VePes end louwes bonds PovÍdina a
PoRcise asgnPtotic Sooth gcte.
Q-Disfesenticte ca Poiosi cmd PoSteain naltsis.
A Poieni cmadsis - IhecSe Hcl cmal~sis done
befese the cldoaithm i5 inflemen te). tis
besed an mathematica calalctions i cnd
Poedictions.
A Posteioni cmaldsis :- EmPioical crma ldsis
Condvched cftez the altooithm is imfleme
hted , bused Cn cchucl Pesfomme mecsu
ements.

Q-4LoisSCUSS the generil Plun steps faa muthe

metical cnaldlsiS Of a non- ecvOsive clgo
SteP1- Sfecifd the CAAoaithm
Step2- Depine the ih Pt cnd ovtPut.
SteP3! ldentifa busic oPeoations.
StepLE CoUnt the mbeo of Ofeoahions fo
Ecich inpot
 Date
Page

StepS- Crpsess the tot Petion cnt

AS a Aunc tion of the ihput Si2e

Mtoic muliPicution calgooithm.

Q-lo. Disaiss the Gerne Plum sBeps fos
oo muthe
mutical cneldsis of a rcvISiVe lAorthn.
StePI'- SPecita the altooithm
SteP2o pefie the inRt cnd ovtft
Step3i- ldentf besic oPeutions
selutjons or
Becussiye ccNs.
Sep5- Solye the evosence seletions.
e - TowCS of bemoi Fibe'ucci seies,
Ric too ical of numbes

eplain the thoee notttion i) Biào

m ometey li thetewth ernPles
Biao'- VPReo boundec- oCn'2 Aledrtic.

Cooc

teee
Thete
Clog
Soo

250 S0o
mput si2e (n