0 ratings 0% found this document useful (0 votes) 25 views 33 pages DAA Unit 3 (Dynamic Programming)
The document discusses dynamic programming as a method for solving optimization problems by breaking them down into simpler subproblems. It highlights the efficiency of dynamic programming in reducing the complexity of enumeration and provides examples of its application in various algorithms, such as shortest path and matrix multiplication. The text also touches on the importance of decision sequences and the use of memorization techniques to enhance performance.
AI-enhanced title and description
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content,
claim it here .
Available Formats
Download as PDF or read online on Scribd
Carousel Previous Carousel Next
Save DAA Unit 3(Dynamic Programming) For Later ON(T= 4
Dynan Prrogia rng
Creneral Mellod » -
See ts aw ale
peat “Uy aft gs
desian wnethod Reh werkt on oplinrrecion.
Tea approach werk on divide and congrer,
wore a problems Se divided Vhs Subpre lens
tron solutlon ak there sulpecblens< rue conpined,
teroewes problen wort nal partitioned into
: Non Ane e ubpreblene we overlp
depended “ocbplirs Ost Seales. nck belli
S geacanin 1s selved only mee verul He
Dn peed wellod, only ome Aeusion sequen ce a4
ever generated , were ian dynansie pee
wey decision Seqguentes moa be qenesded .
S Dyramsc programe drastically swceduces tHe
crowd of enumeration by avarding the enumenchy,
oh some dedision sequenced toot control potibly
be op krat, on oplinal seqruence of decdeememmnn
obtained by using Hee principle & optranalilz
at vosuallyy applied on ilesohve mathod bel
RecwS&ve demchons teo take “ih.
Dy nine programming adaple, memerraton ad
toloudabion technique. er
aCkomple s- Hbonaccr center ung Resin
tnd Red 9)
7 (neal),
nelian
jrelian bl bln) 4 Lib;
%
Gee
nis).e 7 08)
pag
fb) Pile) =
1S), io
Bb), eR wae ool eg
ou
Bue). wee) blo) — FW) bh) ae
top down & prroach ble) ht) :
Tee compheritey Vntrewtes cpanel ol
row meditted toy memorzation valng an
ee ENE aE
Ove oes ate
ie Css
ee
aay al ta
play
0 | tania EMIS}qedeos Se
LAGA Nevyleeny tet
é lr
arias Ursa ahi 2
eS
yearn ETE,
a
F wwiRtae Is} —) bottom up eppsoach.
Application ach Dynamic progaomang
> AL patxs chottert _paill E ;
4 Leal Ge, €) be & dirvetled apeph vat n
exticen Lal cost be cost adjacency pple bod
& suck tral cot )2 os 1eien ae
coat O44) be She Jengtty of dae aa af
ea cortlind Jee 1h tH ud, ¢
5 The all parks chotlerl ~ patty py
a wala & suc Seat Ali,
Heo shotted pot dom 14
sy sungle SOURCE chortest _ patte
algeritn) take O(n) toOS IEN ex aeo ta attane votes, Soh n smal Sovrce
it role O(nxnr). o(as Jhmes
Nn Bea Ly CaN er ex ost yc A
Np eminf hte ]) AG ds ARDS R=!
ansl best NG,4) a col 4)
he above eqrecation can be colvedl Pos a" by
Com puting aunty aE xe A”
\
OOP he
== - hestewt A-heliecn
A) Complete ape ee :
yoticen por follnw rg graph:
«
AU) emt
\ a gett lam
AQ amen iha, YW, AU
Sin (NGO
i -|
aval )» A(t >) *
°5
bn aoe mat A(t), AC )+ atn2) 4
emiat a, os 4k nee
PLS ee rat Cnn) Br te ACES
twin fn ore Wes cee
ead cran (ele), A(a,1) 4 AC Ys
2 min ' 6, Ci Ok 2G
i Gang arena Ca, )
2, gry re
ain) amin (8 Ord) a, pre rut
crinfr geebet
ale) pees C79
Potato
Alla ne) Sinaia (Ants D> rE
eur ay
erin toe, Bek 24 |
rye mad ta2) 1) 40 Ole '
cs Poe es
.
a(S,
oe
v
ae
wan o
pee) ip
Sane
leew)
BoX ae
a (1s) = Spr S ih A (UR)
= min { 0) 46%
Ao, vy cuunth Caerf ee On aay
at, Co Alt ALA), Al a4 a'(ry 3) 8
2 aa 5 at ot ea
aya a(w yh
a (2,1) eelag Gl aly WC
+ win fb Or a ae
nN (2,2 MRA ila at Air rV4
- mn Bn otoke °o
(2,8) smiat aa), a'(y 2
= rmiatr poruks phe
Arar) = a PION, al(aryan
SCREENS
ple) = maf hry A DANES
AS or aoa A
atlas) amiain (aay, al (a,2)4 AUR) %
zringo, Fa rhs ©
een (Cem) ie:
Atala
Ome
a)
HC eae ee
AO) = at rl pAb) PRON) vO sin
ere Ouse. ‘ 3
pe) eriad A(t, 2) ‘ aX ya
ewinfin;, 643 ee
BQ) = inh Ras), As) al
ering 6, d+ ay :
ja nas)
4lll
“ a ”
nl, 1): nig A (uri), Area) 4 nO)
emint g, Gasres
3 , ,
A '(242) mat Arla .&), Ares) anise)
rminfo,2 +¥= ©
AX(2,3) ~ aa gn (sd), Arar syanle/2)%
Bini ntitee, uit ok nr
PD = wingman, Parse nk
emagra,od Byods /
Ree re meme nay h), pla ryan-r)%
erin 10 48k F
A(a,%)s ria ats, 31, B33) + (8/3) 8
= mint, O*OK EO
fala 4 “|
& a ra
AlgesiIhm MiPathaleost A 17)
nrockyr i
TI cos (EW 1 NY os cost EN
1 ATE AA Ae Cost of & hotlext. pth Bem vatlex's
Y xo qr cos tf 4 =~ 0,0 fos Veen
t
fos treet to n do
doh jel ton do
ACh {Vs eoll4y
fot kre! ten obo r
Lot jizt on do J
gos fic to md
Attic esaQt5Y
(
\
\
Chsined ywolix mulfiplicaten
OO eee One 7 Eamon
A a a Q a & bri bar
nay Ane VY)
ae Be bay 37d
On byt Onabay* aribsy aealance at |
Qyiby + Gibet dggba) Aribird Peers,
no- of moclfiphicalien s Ses ae Ve
Cosides
e Ay x ALY a ta nwahies
” ve ete uk dimenstons
eG P, P, '3 eX nti
. Ae Gueaa)
(Woxta) As on oe os
5AM sss m{uide O aha gxuKx4
nde x SX MEM tile=0 Due.
elke p, PEs mised = ertitd+ a 34
mt sterhels oy yx uxt Bate
Po ty be
= wh 40 4 LKUXT t
woe Hea
40 ae
ae Cokes? 2 ¢ wmike
Ry observing Heoxe
tod ola 403
(tq: wen
eke]
{mts Kym OO et 1 nas
Poa
Pod OCU.
COLE CC CECE Cee MIEEEEC OEE ECE OS
OE eS ll—. ~~~ Seereegtevetetcegeeeeeceeeceeeceeereecreste
Malin chain wullphéalion is cnr opiliméaclion
problem Lhet fin ate mos! efficient way to
mudtiply qeven Sequence ol malrices. Thy pro blen
ts vel actially +0 perform fle multiplication,
bul 4to dlectole fe seyuen@ of the rele
mel plications cA prrertlesine malin ruecllipLecechy
eat A, Aver- == fy be sequence of
mewn iy [he aulfiphied » dgsume thal wabiy
Ae Loe dimensions ps) xPz fed e270 as
Py) whe plengfh=m+!
\npod sequence p= (Por Pi Pe
alah prerilenrieg Cate Lh
Us " Ba
ph le proble we 2s rene crime. tt ive ve]
fos some ‘iwheqes in ta RaW TEKEY) produdl
Gun het Uepled oa Mie2 We
molk ply tem Logettor te produce va Pihal
puoaucl AS = = 7 ee |
nee ct pesentbeiring y dat Ra Cot
of compahng tLe vachiig Ail pls
cost of Compuching Ae ES 4 , Pe
yolue forging from 12 kd:
al gl - won ae—
Tie eaTweawewaweeeese STlUSeTelhlUcehlU eel erehlU SC hlU wwe eemlCUlrmhUcrmhlULeTlUL PC.
Recieve eqyuoten
i a4 ° if iy
NO ee
| ? geal ka malian] 4 Ca 0, Pit ii
min
tak
Lary toble raat
rasan ww chia A wo eX cd wu k
mon, enh Los Stoling tte ming 1 costs and
auditor doable s(n) jtol secon which
rade of Is achieved te op tinue east
Computing oti 4 a
pore ; . 3
Niger thm Malsixdlainodes fee
nz P lengbl- i:
ted eft unr gfiin-121n) be new ebolor
fot yc l ton
mend =o)
EN Ae os
Sa fel be not \
“As tes ae \y
pelo e
Demo egress
vem, + mitt 54 ~ Piel Phy
yh as Ree chen length
verusyn % 4S
dyer
midds Vv
isi aie kKi ee ee
exampl 22 Maen chown nulliplic alin cath follarirng
ee
Aferxr, Arzand, Ax =Bxy Au a
Ay x Ar * Ag yx Ay ee as
alee Ace (Aang Sh
2 fe Uk B a \
° %\ fe Py p eee ,
(A, x Renin
i 4 fi Get foal
Cpe pee SS
a © }au|es Lh |
: ae : . |
& 2
0, Mp ds 6 mCi
ag mei i320, Mb 3 =
muy -o
Lid = etn Feiner fete MPG
te Ke?
mir a win fee amQ, 24 P, ‘ ra
N= ke i
ma, sd apentnb ats meGed+e, FL Pah
s mingere Fox sxe = UM
ens
en{3.u) = min med smd Pe Ps i
ae poross dae
ae ee4 ‘ 8mis} = min re Se
eke LU mOr a aera a P oe
© 3
5 ee 2XUxX &y
We Re
Ke a. el
mp, 4d = min ks
2ekH
mB? + mf 4) + is Py
bei Dik Cont HBOS
comin ae is
rekeu\ au +o eek 9 *
. qo,
re. abu
aeku| 64
mC) erin rain
here es mtd - maa t+ Pola Py,
mlinaaysanna WM Patna Pals:
at
- egm(r, et] am(3 414 Poeba Ra
ea
.
= ms
pee
ie ee 6 Ona vape sss”)
(ieeees | ses
eons
PCs
RENAN ie
See eo ea
SOE
Posantlos 2 G of AW Arb AyxAe
(K, KAT x Py) XAY a
(Ry & Ax Ay Aly= Optional binany seaach trees
Comet des beet aA elenorts $10 12) 20,40, 8,028
)
AN = ; .
-\ Ene oeN
; leu HO. . 5 derma nodes,
) Level -O F zy on f i \.
; Vevel-3. a a Sucl saspel Sp -
7 / i 3 Prolooder tity 23 PCJ
y
> a t .
ere ana a >.)
, ae
, ace unsucremful prrokabs lity
j ts y(?)
» no- of binary search Avees oxoulable ath mn node
b TO Men alas My |
> ne| ares
sts 5
Dee only 2 wade wlrdegrency
> can aes Ay!
4 : JD ) 12)
“ Oe Es vey coy
“2
» 8 » nes
D inc. R Conparison= ill
Con perions
Dien ve £
tng a 35
>
>
> det wy Oeste Heol Hee “
y Ta tree An be rade mote effrecernt by a
)
)Oven a fixed sed ay Modi frers Arle,
O11 A, Axh fn different key - A sotbed other such
Hod a; ca ,eastay- Let PCr) be te probaly lit
of a _ secs fil ry pa aren | 4) be AC
probeor lity ch wncuccessfel( easel, LA key X.
ZA 6 binatey Search tree Vepvesecl 1 Pen tries
Han Hey usll be exachhy Ma) dernet rides §
WA enteral nodes
[au
Fea, ails
‘ ‘ dedi ies we
wif] represen! Ne woos cure Bh Ze,
werght ie
pale dees id
ods “thes oott an op
yore eaN
; hat binacy
Gn ce as
ceoach dwee:
i ;
nocle a) optival aes
je Ciara ae ein. fe6,« Gacodli
Noles cUiideo ond w{i,11 = 40a "
Pee re
ith
ard AULA repel the wel
seosch tree -SS a a eee eer rae eae aS SS ee
ere fetes 3
Teo $0 lve te preb
woe usll perform follnsing steps
step gi Notations poea
(ape maling aliyrort c ap proath
let +342 ppetlare-~ ,a4)
cUfl= denotes cast (TG I
hale vege OH)
Ton = Prat “bu oblaived
Slap lt The OBST Can be bull ce te ne
i, Ae Comider ta proces cxtating
eb el he an OfST fot Hi chemad;
ted Lee R be UB left
Hol tHe Noa od. lay,
A Z0,e- SOY ond
maghl sub lies , Suppose
iy aly, ae kee ,
Lon plore re L ahd Aya — Ae. ¢ yi ened
R ah Op Vice” 1p
Te cot of Computing Tan Can be ga
CUTon \ = CCE) FOUY £ PtP REG YE
te C(ton) > CUL)+C(RA) +00gee a ret an optimal binary Seach
vee tan toe cur firal anether tree L' ft
Some lemenfs urth tte properly c(L'y2c(t)
hed 7 dal be Hu tree anth wool ae Aept
Soblvee LS anol right subtree R thon tec)
+ (R) + W
OP eerste A
42C[fon)
Ve Pay ophhual then Ton Tis cnthealiolh
da Jacl the Tee uean 0 BS
pan) mutt be an cplinal bt ili elencescle
Dr Han Some manner we Caw ctolain opttrwal tree
F fot R
te * we sll apply goltnoig fein fh coup,
- tng oo th Sequence i
COjdenn ’ {cu keite cfg Tht woth f 14
iekSj
wigl= ecyye Ore ols Te
Eel =
extn
ane Pevlumecencerne (ch
Fix values Fes ps & 4s ane x ven y
(Cron gates 4) = (2.2 YG1) Cosbrucd1 op Jay Mee Aellsvsing Rorneulie far the Conepucechor
ee a
wh d=
c(i ico
nee
wllo,o)\= Anam
abs Payers
Wir 6) =O 21
w (2, Seen
Wie] -> We!
tiers
c(o,osz
‘vLo,o} =o
el leo
sO,Q-o
(cea
v(r te
ca ..je6e
Ysd=0
cui4qro
yeu wjcoae - & & bE 8 is le !
ecececceeeeeeeeeereeerrve
e
fhe values, of wy yw dA 4re | EEE
&L $—.
wd = (3) A
weds B, cL *c
waar 2a + e(glez wn elie
rcs, er
Cfo \= man lewortech.n
ockkeeg *
ee
Erdinda Lose seg
xed = {)
cof, rye Pot Me svelt,")
o 4 ay hes oy
coe nn “yet v\e c{2.t\* w(t, er
peket
\ ne oat he
= res
Cfo js ker
wh, ee Pa Ga Paco es: a
cz ey +128
coat rgiy fled oases
a sto or B43
oe
habe ta hes eb2l
aye ler 7
(ste oe, welt: ay acta s+ w [art
x mip, FOF O48 shud EoThe Values of wie,e fod g-i=r
worse tL 4%, + wlot |
zBrl eS cir
oa acl aj) + on
cord eet + eb
Cfo ,2V= win
cocker ©
. AC leant
. wan =n
BAkeE ne @erac = Kt
w[o r= k=1
wr, ads P44, + e023
a ee ee oe
g
aaa eae ee oma
os
IPERS oc liy 22) eet eel
ee ore =o cae
wk22 | gr o4+4
neo
oo (rz, 4) = Pt Vig + OEY
pe ee a
cfu zn (Cee eee
LekeH Cf2a reek + HE]
sin ott SC 2
perc | qgrore S ~
y
yi 734
Tip values of Wy Cy ¥ 40% fle 3
{0134 = Py + Py 4 wo, 24
Bea aiseae ee ee ee
= {o13 a mi( Cfoodectt, 3) He
c {o13)\ ne etoratectes} iy
4 Liefesrzqsc(s.sye whee
GFo+l H th} c24¢
reese Saf ‘
mae Jd Panam)
os mals
(9 aon '™ \ 2
ylorg.h2 2
bol tate 2 fa Vn, wl, 3)
{eve 4 i A =
Prayer Gey al mee!
€ (eneulee nN fais 08 vol 4]
be ea ecG |) eelowd
ee og teil
ie ie cali
he Aerie
efi uhe ao
aa value af WIEN FA joe 4 ar toeredd = fa t@ae eles
hea 4c ees) +
ean pabantey cle (api cee dat ey
4 efor 23 eel, HQ vvled \
Wh coat) ee Cu ay + Cord
, 0+ 1946 a)
tmig
. Bt gale oo ye
ORE J ge ec [ceed BY * ee
2S One 4
fouls BOPOC OCC CCC CMM HMMS SC HHHCHOHEECCCCS
There fae tree Tor, bas a root You =L- fron
(a, 1, 74 hans (do, tity nec while), arslf becomes
the ‘ool rede -
Tan Yi ket becomes ledt child 2 %es4 becmey
wight child ie wo, becones Leff child $¢ ry becauney
‘eight cbelds Here 21, 50 41 becomes left child ed
Daiclcola eS lt) > hee Geol seceny2) atglt eld ob ay
feX pod ry) 122, 42G KET hence left hy
of th be wy co he, left chet ts engl Te ghd
child of wy is ¥yay, Henle ay becomel ght
Cla dee stare ees opttnsel binady search tree yi,
re4
Alagatitiarn OBST P49)
fer tao bon-! do
dite
wii. - gli q sli Iso; cfr, 20-
Mf optimal Ayees uth ome rode
>
J
wo (dard salty eyed tele;
VE t+ Qe tans
c(t 4 Me gfiteylit Grete;
% ,
von m= yrds vnmd=os clan] = 0-0;
fA met de nda (fad optinnal Ayes pith
ter T= ot6 nem do
(eee & '
t- t MN,
vo(i,gd= wo (ig-10 a eGd +VCE Is
ke Pinder t,9)5
eC Flew G14 Cite + elke];
vil = K,
write (6C fowl, werd ‘i Nfomn);
Algettting flrok COs tf)
men = 0,
tA mof'7-'9 ee hed ale
tFCclii me FC lng 3) e min then
i efi; m1] ao :
PL age
— SS OVPRZVIDIOCUCC CCC ECPM eH MSC HCHO CECE ECCLESaca re Te ee ais
vetuny L,; 7
is .
Alges\ttin Buold rlveelyai4 3
CS Nz Néta(nede J,
ee ra
T= dodger altel,
if(]: e ee) felurn 4 9
ale Se ear a tree (474.1, k= as
Fo ¥ abd: build reelma kgs
3 ik:
Tine Lomplenity
each cht 4] can
The total me fet all c(t, 4)'S wn Hy jrizm 5 Olomn-
C2 O(nm- rr). Ta Acted tyme to eu alucte
otk cfisyys 4 a yYs ts
an (nm- ual *)
be Cmapudedt jy hee O(m)
= yeh ant an — Vt ~~ EN) = f= Jinen
econ - Ws ae an)
= n [terest - en\ - [adh aaa -~4n)
> np Nee |S mnt) (U4)
% % :
SNS aya
ta) > Olr )OLE _RNAPSACK PROBLEM ;
—> 4 we ase given ‘on Objects & Q knappack TRA >
aa are Ke object t that has COLaght We & fe be i
: Napsack thasa Capacity then the poohit i]
Be earned & Pte The objective taste chtotn JE
Ph Kmapinck titi mnademum Peopit Comneds
> dem ts Xe Gek Manimizx d "e_ Patt Buble ot te Cem
ZQruen wher tena n ty detal no: of, &
Lez O Rl.
We Solve this psoblen Using dy sate pregeit
WE LL Pertein followotne Alzps, ™
Sep 4: the Motokions Cased Org - Jot +, ly.) ie
a (43) And Wed aati Ss 29 Co,8)4 q
1.4 2 Con Cem Orto# Computations of o' are basically the 42 qtion ee “AM
Rialonsa wade farc btaining the optima selulior
gt : oe \
mesh) Wwe can quote the Sequence 4, deciat om 4
/ “i der te Obtain the optimam selection fox lyn?
9
the Knapsack Peoblem . - @
Skep 3 the fosmutae that axe ured atile setuings
|i knapsack &
Zen They
lak 4:44) bethe value of onfmal Saas
wy emma $ bat) $, Gren +n i
Anitrally Compute
| F=L 10,04 ; . 7
, t
| %, =U, tw) LPa?, 40 + e)S q :
| ‘al ; ‘ a
| g, Can be Compuled by merging se Ei
} ° i ' -} y
| Purging Ruler 44 c+! eontodns CF) and CP» OR
| and y Pp SP d WP % WO then CPs , Wg) CON be elimont
| Wes Purging surle ta also called as Aomimance Rute,
| An Purging mute basteally the dominated Lc ple got
|| Puaged. to sherk, Memoye a Pat. cotth tus peat
Ond MEL Loeeght:
,
ae4
i
( Ps con >
>
\ t em a
& & g ‘
3 5 4 >
Hf 6 5 i
> Build the Sequence of decision oe, gest - a
ei ee ct
s = La, 2) 4 2
Fe at
p02 cus cocinanal ae inataneey nn e18 Tee
fet PER WO; Axe ax Ahowm beboos .
tohile building $° ewe select he ert ch Pais Fee
Swe have selecg Past (Rt) Pate wohich & U2)
a= Lmege Past 2
a =$ W&,0), Cr2dy i
az § Select ment pau and add ct worth 34 a
=9@,2), (240; 8 +6) (a4, 34204
gi) a $@.a3 C594 3
F =Fmerge g, s\§ a
= Soo) C12 3) 2804
BS select ment frrr MA add
=¥5 ia) (So, H+0) GSaiaa +2) ($424 8m
Gb weih 3h- BH SB (4B) AD Le) =
FF &={muge easy
$23 0,05, UU G@ADG,s) (6,4) Cr
Th Potr (3-8) ts pusge d
WRrw)> GS) A (Pr toe) a
ts tun. $0 ebfmonake (3.8) TOMS "5
5) ra) C&L,
foo & because,
= 64). Hew P5S PS
199 eZ
Mize
o:[..8), ud 02, 65,4) LE, 69C1,7) ts, ‘
a =f tes) (exo (TRO LOA! BD (6t2,E43) (6+ SASF a
Lore, STOLE, Set) Ets, $4994 S
Fe) a4 ay >
cee Cens)) cry C8, eM C0 >
t.60%,5]
Bace mae. and we get pau Ce)
Nota te seleck Nett fran object do P-Piy < O”Nys
ene tS) =@,0
te & Hee Gel
bre, a
Pole (7,3) belongs
P_P& w-he &
The Mal éotedtion ts Crt Y
g
_9 & 3-3 = 00,0) -
ae M efés ie “4
ae °) a (a) BME BD abs
F Ce LVAD 02 ua, U4)1g Eales Man problem:
a @ beadisedled graph denoted by (v,€) Whee V |
denotes et of Vertices Gnd E denotes ack of ed $
The edaoes are xen along eocth thei cost Cry hey
Cos Ciys0 for alt URL. 4 thee moedge betioesn ftp
then Cay 90+ : i
> A dour Fox the gaaph Should be Such that alt the J,
Verticer ahould be visited only ‘once Gnd Cost tf the X
doug Us dam of Cost of edges on the Lour- The
txcrteLling kale person problem ts te find the tour oh
Mumememn Cok,
Egret Progamming fa ased & delve this podem,
Step 15 dek the toncen CUY-$QV% Ay tol,
Leng dR of the eux Leaminiasting ak 4. The objectee
of Tsp psoblem ts that. the Cos of thus tour ahould
he mniniencen » i
ae tok Att al be the Shextest Path helideen Lice Vested
c&L: i
Shep 2s Lek WiVar Nn be the Sequence of vertices
elLovoea wo optimal dour, Then (Cv, Nove Ne) TULA 5
be a Bhostest path ytom V, 6 Vn Cokich Passes tiroughs
och veka exactly once, Hence the prindgle oh
optermoliby is USed- te gue all
the path Ve, Nia? s : .3
Rods beginning ok VCO, ending at VOX) and Possing
Though alt the taternectiots Vek Cees Vey -*Ve 2 md
yyLa Following fosmita Can be used & obtal
2 opimum Cost ts ux,
Cost (tys)=mmin$d Ci,%} + eoseCh, $— £13) 4
tohae yeg Andifs =
| lek ge Ken 2
Coe (a,&, = ees
4) Cost (3,8, 9 = At D>
cost (,&, = AO AB
| Skep Qe
|
|
| 9
| S2fone elemenk 4 ;
Cost (2,2 min Jd Ct.) 4 cork (8, 8-152 ) 3
| Hence dtom Vertia ab 4, Vetix 34 and verts
| ty we 4 by con adetng inlirmedtots Patr lengths’
| Wwe wi Coleulake total optimum Cet - ;
Gos (2, 3h 1) = 213) + COS (370 1) 245 Geis
Cost (3, $a) = A OA) * cost (uy 8,1) =lO+8 = 19
eosk (8, (qt, ~4 (3,QD ¥ Cost (9, 8,1 = 8415 =120
yy(3,Qu%,)) AB AD4 Costly, 4,1) 1246 224;
Ut $24 1) = Ay, 2) eost (2,8,1) = 847 =13
Cosk G4 Fak) =AU4,3) yeost (3,8, negts ea oe) A
Sep $29 Wo element? y
Cok &
OEE, GA) emtn f fa Gay + cost C, 163, OE
[a G4) cost U4, 923, IG ;
Emin 4 + De ey sy) 2a
aa Cada, D amin} {acs,2) +cok C2843, J 2
(4 Guy + Cost (4,423, nd
£ |
Emen§} UZtig, U2+ay zas |
|
cost (4 $2.34, 0) Emin FTA CH 2) 4 Cost (2 $a4r :
Lay, 2) + Cost (3,923, 1) 3
=min§ Ce +is), Carteyg 223
step 4: Consider Sof Thee Clement’,
g intial Vertirc
AS Vata 4 har been choosen
the cle Should be Completed 40 the Finak
Vested Ahowld be 4
Cost), $2,3/43, =mbn {A LA + Cost (2,93, 43,19,
fac de Cot By 43, 5)
[a U,H)+ cost (4,921 34, 0.14
=min§ WorRs)/LiS+28), (20 Dh 2
=W 25.0 IEE’”’SC oq <—_
4 the optimal tour ts oF Path tengih 39»
Soncider skeply, dtom Vein 4 ‘woe obtain Ae
[dphimuun Path as d U2) + Hence select Veer a.
Now Congrcles Step, In hich from Veulan 2 WE
prises Optimum coat drom AB,H). Hence Select
Nex Ly. Now th stepo we. get damoining Vvertr3
de ACE AD G optimum. Bence optimal Cour bs 1,2,4,3
RELARIUTY DESIGN
lsIn is peoblem the Main aim is fe chtan good
Perhemance fiom a Aysten eq which eed devices —
BAL Connecksd (1 a Aeuea as follow 3 3
tp as > *-- a |r ;
Ls tohon devices Axe Connecled togettor then iE G 2
Mecesary that each device Should work property , :
| The probability hat device t cot wor k Peepest,
| te colted scebiaktlit, of thak beige -cleuice . ‘
lek x be the Paliability of device D» Gen dellall
| Lde A, (endividirat device & Vou good) entute Ayelea
; iT, At may Rapper thak even 4 srobi Gt ot, ‘
Ywndvidual device t Vey good but Helin? lity 64 2
7 Ondtice Bester oy net be Good. Hence Lo obtat» he goss
Perketmane qiom entire Ayton we Can duplicate ~
individual devices And Can Connect Fhem OQ anja,
Bale 55; attach duvices fo Switching etrouits Ty
Leg kukiching cicuik ts da delrmine echich device
Se Austtching eicuik ts te @ cohich device
€, cooking: properly -= ane ae N —
ml \ [p,\ | [ ( D3\ |
\ 4
Bl | a | ro) Seael
[d,\ a See ae
5 \ | |
i | ea |
stage 4 kage a Stage a Stoge
multiple Devices connected Jagebhen
epdek ™ be the copies of device De ten (i-*e)" be tHe,
Hence the
Probakility thak all me have a malbunckion «
Stage Keliability & 1-C yy, weet denote
Helio bility of Stage L by aime)
Hence dylme) = 1-8
>In neliabiliby desiga psoblem woe etpegt Lo ge
smonimum Sreliob Cty asing clevtce. durplicaleen r
Marimtn Sebabiiky FOC" e) fs aakjeded &
BCom, &C whee cy ts the COE fe of Coat each
device And @ & the POOLE nein eoLctbalbl encase the «
aye.
The Upper bound &
Bb , =Loexe -2¢3) heal
— the dynamic. Psogamaning decom uae
dupes othe Soom GD coher £ =) The f2
. >
Ora he Carameland OA
pe ite a
- on the Cost Can beldetieaaul
“$yflv) = mar} Domi CO —cemr) |
intiotly f. Come {
fF ($,.%) deme (4, 12) bf ren
“he Aominaled kaples can be discaided from ae
Puagiging Rule.
&4,<%s