0% found this document useful (0 votes)
39 views9 pagesDAA Assignment 2
The document discusses the principle of optimality and dynamic programming, detailing how complex problems can be broken down into smaller subproblems for optimal solutions. It covers various applications such as graph coloring, scheduling, and the traveling salesman problem, emphasizing the importance of recurrence relations and base cases in problem-solving. Additionally, it touches on NP-completeness and reductions between problems, illustrating the complexity of computational problems.
Uploaded by
Achintya BansalCopyright
© © 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
0% found this document useful (0 votes)
39 views9 pagesDAA Assignment 2
The document discusses the principle of optimality and dynamic programming, detailing how complex problems can be broken down into smaller subproblems for optimal solutions. It covers various applications such as graph coloring, scheduling, and the traveling salesman problem, emphasizing the importance of recurrence relations and base cases in problem-solving. Additionally, it touches on NP-completeness and reductions between problems, illustrating the complexity of computational problems.
Uploaded by
Achintya BansalCopyright
© © 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
/ 9
Name ~ Vishesh Aggownt
Broweh - AIM 8)
Semates -
Grrolment Nombey ~ 1037711 622
Date - 2-0-2024
Pestan andar Anol Algonth ras
a me peinciple oF optimality. Wher ad how olynguce
i iG
nn 0 r
The Prteciple of tpbinali
stakes tok fe on optimal Aolupion,
qo prebleny, Cock Adbproblem within thak toon must
disc be — ophimal . thi ps0 enobles the preblem to be
ane down dbo Armpler, ove
bisenhal
pp in Avbpyoblems , whith it
{* Aynomie ieee "0 P
Dyna Prgrommig i opplintole- whew :
%) Ovubpping Sitprebloms - ‘the problem con be —alivileal into
Smoller Freer) Avbproblems «
© Ophnal Suuemehse - Optimal Aototions to
be combed te buvbl the
pooblem .
Avb problems
Con
& the mam
Aolvhion
Steps + °*re) Dyrom'e Begrommenira
o) Define the hates Ado vaninbes te Represent ech.
Avbproblem :
© Recusrence Relakion: formulahe a elation trot connects the
Adlubon of the main problem to ike Aobpreblems.
© Base Cases: Anihalize Aetuhtons ee the Amollest Aobproblems.
a) Memosteahion oF —Telnlotvow
3 Use memorization ( tep- olen) fo sow Computeal golupions
of scbprobleme.
> Use tabulation C bottom-up) te build selohiout iteahvely.
2 Exploin opplveation of greph ni problem.
WS he goph ator problem fy about cusipning colors fo
fer vewtices “so thak ne wo apliocent Verhtes bare
He tome bolov, vor the minty vumbex OT color Mw wovel Opnittable in deenantae — wher® ton Hele oy
Oredlope ruc ye wmtniaed , Vewe aye — cowne Fey rplica hin:
Scheduling veel Boe filly
S the Me cavoling 8 eclules where (or feeding ewenls
font Oefaty of Othe font lime.
* for eXwmnlé >
Sholeule ane contiplared” — acdinvent:
lo aunyned different time “ol (
veiv entity ee wounies foul Abaya
verter and wiuet
) 1e Avail clashes,
» mp Coloring 5
> Gores thet reipiebounind negions on aap ane — colureel
Arey ‘ maliog i tol 4 lo Asin wich lhem ,
four Coley Theorem,
Yt epplaton 8 famnout for tne.
whi disks that any rap wn be loloyed with
almoct fe lolovs without Oral cere Diegi'ons Chasing
ce colo. ‘ d
» lester Altocafion in lompiders |
Te Compile’ Optimization, vaniubles that cannot be wed
Aepacsenled on Gel baw
Seon Cob te cowdiels) are.
variables
VOMees aig. tos “i Phe tompllent alwcate
doa “pt ace of 2 Dreweslers Pointing raenntn)
vege ond daproving (itera:
4) Network — Frequesey — Aliecattou'
Im wrvelens — netortvks adduced vieder (he ra don'ts ov
fowert cbse chomp fo paleedare wit cach ther) need
dyprewt repencies Greph ay help« minine free
Hrense er) Cod ooled Anywod femurs lear ysttheh
interference, . Qs Whok & travel Salerman blem (352)? rol tHe Aolotion
of ~Whe owed P “9 Bronce & Bord Method .
-_... —— a
a? fala! ol}
ae ee
e/a] S}ofaf4
o | ate fi] of 3
e{™{4]a}a]o
Avs he Trowel Glesman Problem CSP) geks the shortest
posible vod? trod visits Coch ary in @ lst erdly once.
ond newmne the aterting a
* Objechve: Maimise fotal trovel oltstance or coSb.
fomsbvomts ¢ Vist each “ty ore mm a clored lop.
fos Reduhion > *
Cloma Legluchion = ©
“| Teed Reduchion 2
Bo Reduction & hmm bechicton.
& 0 a)
2 |e 7m hy 2 0
ala oe ese 24
a 28
me 3] was
ole 13 7 ho
q
ga 8 oe BAde o
Broo v
w
gasrad
BWege a oo
genes RRTR
yvQvoe.
cc wkonns
J
=Bt 08S
Re 10
oe
GQtso> |
JV 8EIRQ
waQou’ x
ereg T2ye 0
o
tovay ~
< ~
<
a
ow
A
<
299 s8
Agsnos
vtsoev
BsQIohwo
=zQsorg
Fava
Oo 00 0
1 4 02
Se eee
Ise
18
OF THE
Les 2 20
a :
& base¥! > =
ak & Yow Cos 2
CS wanrt oy .
a
4 9 B40%8 ® 5 ObEReV OF 5
> ‘
@ 89998 0 or VERBERY . .
7 FT UMGoMm! 2 Svbougs, ©
te tau oo es ze
