Daa M-4

Design and Analysis of Algorithms
Module 4: Dynamic Programming

Outline
• Introduction to • Optimal Binary Search
Dynamic Trees
Programming • Knapsack problem
– General method with • Bellman-Ford Algorithm
Examples
– Multistage Graphs • Travelling Sales
Person problem
• Transitive Closure:
– Warshall’s Algorithm,
• Reliability design
• All Pairs Shortest Paths:
– Floyd's Algorithm,
2
Outline
Dynamic Trees
Examples
Person problem
• All Pairs Shortest
Paths:
3
Dynamic
•
Programming
Dynamic programming is a technique for
solving problems with overlapping
subproblems.
– subproblems arise from a recurrence relating a
given problem’s solution to solutions of its smaller
subproblems.
– DP suggests solving each of the smaller
subproblems only once and recording the results in
a table from which a solution to the original
problem can then be obtained.
• The Dynamic programming can be used when the
solution to a problem can be viewed as the result
of sequence of decisions.
4
Example-1: Knapsack
Problem
5
Example-2: File merging
problem
6
Principle of Optimality
Difference between greedy and

DP?
7
Outline
Dynamic Trees
Examples
Person problem
8
Multistage
Graphs
9
DP Solution using forward
approach
Cost of node j at
stage i to reach
terminal node t
Stage number
Node
10
cost(5,12)=0
cost(4,9)=c(9,12) = 4
cost(4,10)=c(10,12)=
2
cost(4,11)=c(11,12)=
5
11
cost(4,I) = c(I,L) = 7
cost(4,J) = c(J,L) = 8
cost(4,K) = c(K,L) = 11
cost(3,F) = min { c(F,I) + cost(4,I) | c(F,J) + cost(4,J) }

cost(3,F) = min { 12 + 7 | 9 + 8 } = 17
cost(3,G) = min { c(G,I) + cost(4,I) | c(G,J) + cost(4,J) }
cost(3,G) = min { 5 + 7 | 7 + 8 } = 12
cost(3,H) = min { c(H,J) + cost(4,J) | c(H,K) + cost(4,K) }
cost(3,H) = min { 10 + 8 | 8 + 11 } = 18
cost(2,B) = min { c(B,F) + cost(3,F) | c(B,G) + cost(3,G) | c(B,H) + cost(3,H) }
cost(2,B) = min { 4 + 17 | 8 + 12 | 11 + 18 } = 20
cost(2,C) = min { c(C,F) + cost(3,F) | c(C,G) + cost(3,G) }
cost(2,C) = min { 10 + 17 | 3 + 12 } = 15
cost(2,D) = min { c(D,H) + cost(3,H) }
cost(2,D) = min { 9 + 18 }= 27
cost(2,E) = min { c(E,G) + cost(3,G) | c(E,H) + cost(3,H) }
cost(2,E) = min { 6 + 12 | 12 + 18 } = 18
cost(1,A) = min { c(A,B) + cost(2,B) | c(A,C) + cost(2,C) | c(A,D) + cost(2,D) | c(A,E) +
cost(2,E) }
cost(1,A) = min { 7 + 20 | 6 + 15 | 5 + 27 | 9 + 18 } = 21
Optimal Path: Reused costs are
colored! 12
Principle of optimality w.r.t. Multistage
graph
13
cost(3,D) = c(D,T) = 18
cost(3,E) = c(E,T) = 13
cost(3,F) = c(F,T) = 2
cost(2,A) = min { c(A,D) + cost(3,D) | c(A,E) + cost(3,E) }

cost(2,A) = min { 4 + 18 | 11 + 13 } = 22
cost(2,B) = min { c(B,D) + cost(3,D) | c(B,E) + cost(3,E) | c(B,F) + cost(3,F) }
cost(2,B) = min { 9 + 18 | 5 + 13 | 16+2 } = 18
cost(2,C) = min { c(C,F) + cost(3,F) }
cost(2,C) = min { 2 + 2 } = 4
cost(1,S) = min { c(S,A) + cost(2,A) | c(S,B) + cost(2,B) | c(S,C) + cost(2,C) }
cost(1,S) = min { 1 + 22 | 2 + 18 | 5 + 4 } = 9
Optimal Path: S-C-F-L
14
18
When j=11, only one candidate for r, cost(11) = d(11)=12
r=12 When j=10, only one candidate for c(11,12)+cost(12)=5+0=5; cost(10) d(10)=12
r, r=12 When j=9, only one candidate for cost(9) = c(9,12)+cost(12)=4+0=4; d(9)=12
= c(10,12)+cost(12)=2+0=2;
r, r=12
When j=8, two candidates for r, cost(8) = min { c(8,10)+cost(10)=5+2=7;
r=10,11 c(8,11)+cost(11)=6+5=11; } = 7 d(8)=10
r=9,10 c(7,10)+cost(10)=3+2=5; } = 5 d(7)=10
r=9,10 c(6,10)+cost(10)=5+2=7; } = 7 d(6)=1019
7 4
5 2
When j=11, cost(11) =5; d(11)=12
When j=10, cost(10) =2; d(10)=12
When j=9, cost(9) =4; d(9)=12 7 5
When j=8, cost(8) = 7 d(8)=10
When j=7, cost(7) = 5 d(7)=10
When j=6, cost(6) = 7 d(6)=10
When j=5, two candidates for r, r=7,8 Cost(5) = d(5)=

When j=4, r=11 Cost(4) = d(4)=
When j=3, two candidates for r, r=6,7

`Cost(3) = d(3)=
When j=2, three candidates for r, r=6,7,8 Cost(2) = d(2)= 20

Analysis
Θ( |V| + |E|)
21
Backward
Approach
Cost of node j at
stage i to from
source node s
22
bcost(2,2) = 9
bcost(2,3)=7
bcost(2,4)=3
bcost(2,5)=2
23
Example
bcost(2,B) = c(A,B) = 7
bcost(2,C) = c(A,C) = 6
bcost(2,D) = c(A,D) = 5
bcost(2,E) = c(A,E) = 9.
bcost(3,F) = min { c(B,F) + bcost(2,B) | c(C,F) + bcost(2,C) }
bcost(3,F) = min { 4 + 7 | 10 + 6 } = 11
bcost(3,G) = min { c(B,G) + bcost(2,B) | c(C,G) + bcost(2,C) | c(E,G)
+ bcost(2,E) }
bcost(3,G) = min { 8 + 7 | 3 + 6 | 6 + 9 } = 9
bcost(3,H) = min { c(B,H) + bcost(2,B) | c(D,H) + bcost(2,D) | c(E,H)
+ bcost(2,E) }
bcost(3,H) = min { 11 + 7 | 9 + 5 | 12 + 9 } = 14
bcost(4,I) = min { c(F,I) + bcost(3,F) | c(G,I) + bcost(3,G) }
bcost(4,I) = min { 12 + 11 | 5 + 9 } = 14
bcost(4,J) = min { c(F,J) + bcost(3,F) | c(G,J) + bcost(3,G) | c(H,J)
+ bcost(3,H) }
bcost(4,J) = min { 9 + 11 | 7 + 9 | 10 + 14 } = 16
bcost(4,K) = min { c(H,K) + cost(3,H) }
bcost(5,L)
bcost(4,K) = min { 8
c(I,L) + =
+ 14 } bcost(4,I)
22 | c(J,L) + bcost(4,J) | c(K,L)
+ bcost(4,K) }
bcost(5,L) = min { 7 + 14 | 8 + 16 | 11 + 22 } =
21
Path: A-C-G-I-L Reused costs are
colored! 24
26
Multistage
Graph
27
Outline
Dynamic Trees
Examples
Person problem
28
Transitive
Closure
Definition: The transitive closure of a directed graph with n

vertices can be defined as the n x n boolean matrix T = {tij }, in
which the element in the ith row `and the jth column is 1 if
there exists a nontrivial path (i.e., directed path of a positive
length) from the ith vertex to the jth vertex; otherwise, tij is 0.
29
Transitive
•
Closure
We can generate the transitive closure of a
digraph with the help of depth-first search or
breadth-first search.
• Since this method traverses the same digraph
several times, we can use a better algorithm called
Warshall’s algorithm.
• Warshall’s algorithm constructs the transitive
closure through a series of n × n boolean matrices:
30
Warshalls
•
Algorithm
The element in the ith row and jth column of matrix R(k) is
equal to 1 if and only if
– there exists a directed path of a positive length from
the ith vertex to the jth vertex with each intermediate
vertex, if any, numbered not higher than k.
• This means that there exists a path from the ith vertex vi
to the jth vertex vj with each intermediate vertex
numbered not higher than k:
vi, a list of intermediate vertices each numbered not higher
than k, vj
31
Warshalls
Algorithm
Two situations regarding this path are possible.
1. In the first, the list of its intermediate vertices
does not contain the kth vertex.
2. The second possibility is that path does contain

the kth vertex vk among the intermediate vertices.
32
33
Algorithm
36
Analysis
• Its time efficiency is Θ(n3).
• We can make the algorithm to run faster by
treating matrix rows as bit strings and employ the
bitwise or operation available in most modern
computer languages.
• Space efficiency
– Although separate matrices for recording
intermediate results of the algorithm are
used, that can be avoided.
37
Outline
Dynamic Trees
Examples
Person problem
• All Pairs Shortest
Paths:
38
All Pairs Shortest
•
Paths
Problem definition: Given a weighted connected
graph (undirected or directed), the all-pairs shortest
paths problem asks to find the distances—i.e., the
lengths of the shortest paths - from each vertex to
all other vertices.
• Applications:
– Communications, transportation networks, and
operations research.
– pre-computing distances for motion planning in
computer games.
39
All Pairs Shortest
Paths
(a) Digraph. (b) Its weight matrix. (c) Its distance matrix
We can generate the distance matrix with

an algorithm that is very similar to Warshall’s
algorithm.
It is called Floyd’s algorithm.

40
Floyds
Algorithm
41
Floyds
Algorithm
42
Analysis
• Its time efficiency is Θ(n3),
– similar to the warshall’s
algorithm.
43
Example
44
Outline
Dynamic Trees
– General method with • Bellman-Ford
Examples
Algorithm
– Multistage Graphs
• Travelling Sales
Person problem
45
Optimal Binary Search
Tree
• A binary search tree is one of the most
important data structures in computer science.
• One of its principal applications is to implement a
dictionary, a set of elements with the operations
of searching, insertion, and deletion.
• The binary search tree for which the average
number of comparisons in a search is the smallest
as possible is called as optimal binary search tree.
• If probabilities of searching for elements of a set
are known an optimal binary search tree can be
constructed.
46
Optimal Binary Search
Tree
Example
• Consider four keys A, B, C, and D to be searched for
with probabilities 0.1, 0.2, 0.4, and 0.3,
respectively.
• 14 different binary search trees are possible
• Two are shown here
• The average number of comparisons in a

successful search in the first of these trees is
0.1 *1 + 0.2 * 2 + 0.4 *3+ 0.3 *4 = 2.9,
0.1 * 2 + 0.2 * 1+ 0.4 * 2 + 0.3 *3= 2.1.
Neither of these two trees is, in fact, optimal.
47
Optimal BST
• For our tiny example, we could find the optimal
tree by generating all 14 binary search trees with
these keys.
• As a general algorithm, this
exhaustive-search approach is unrealistic:
– the total number of binary search trees with
n keys is equal to the nth Catalan number,
which grows to infinity as fast as 4n / n1.5
48
Optimal BST
Problem definition:
• Given a sorted array a1, . . . , an of search keys and an
array p1, . . . , pn of probabilities of searching,
where pi is the probability of searches to ai.
• Construct a binary search tree of all keys such that,
smallest average number of comparisons made in
a successful search.
49
Optimal BST – Solution using
•
DP
So let a , . . . , a be distinct keys ordered from the
1 n
smallest to the largest and let p1, . . . , pn be the
probabilities of searching for them.
• Let C(i, j) be the smallest average number of
comparisons made in a successful search in a binary
search tree Ti j made up of keys ai, . . , aj, where i, j
are some integer indices, 1≤ i ≤ j ≤ n.
• We are interested just in C(1, n).
50
Optimal BST – Solution using
•
DP
To derive a recurrence, we will consider all
possible ways to choose a root ak among the keys
ai, . . . , aj .
51
52
index 1 2 3 4
Example
53
54
index 1 2 3 4
Example
k = 1, C(1,0) + C(2,2), 0.2

C(1,2) = Min + 0.3 = Min + 0.3 = 0.4
k = 2, C(1 ,1) + C(3,2) 0.1
55
index 1 2 3 4
Example
56
index 1 2 3 4
Example
57
index 1 2 3 4
Example
How to construct the

optimal binary search tree?
58
59
60
Analysis
• The algorithm requires O(n2) time and O(n2) storage.
• Therefore, as ‘n’ increases it will run out of
storage even before it runs out of time.
• The storage needed can be reduced by almost half
by implementing the two-dimensional arrays as
one- dimensional arrays.
61
Home
Work
• Find the optimal binary search tree for the
keys A, B, C, D, E with search probabilities
0.1, 0.1, 0.2, 0.2, 0.4 respectively.
62
Outline
Dynamic Trees
Examples
Person problem
• Transitive Closure
63
Knapsack problem using
•
DP
Given n items of known weights w , . . . , w and
1 n
values v1, . . . , vn and a knapsack of capacity W, find
the most valuable subset of the items that fit into
the knapsack.
• To design a DP algorithm, we need to derive a
recurrence relation that expresses a solution in
terms of its smaller sub instances.
• Let us consider an instance defined by the first i
items, 1≤ i ≤ n, with weights w1, . . . , wi, values v1, . . .
, vi , and knapsack capacity j, 1 ≤ j ≤ W.
64
•
DP
Let F(i, j) be the value of an optimal solution to
this instance.
• We can divide all the subsets of the first i items
that fit the knapsack of capacity j into two
categories:
– those that do not include the ith item
– and those that do.
• Among the subsets that do not include the ith item,
– the value of an optimal subset is, by definition,
– i.e F(i , j) = F(i − 1, j).
65
•
DP
Among the subsets that do include the ith item
(hence, j − wi ≥ 0),
– an optimal subset is made up of this item and
– an optimal subset of the first i−1 items that
fits into the knapsack of capacity j − wi .
– The value of such an optimal subset
is F(i , j) = vi + F(i − 1, j − wi)
• Thus, optimal solution among all feasible subsets of
the first I items is the maximum of these two
values.
66
•
DP
It is convenient to define the initial conditions as
follows: F(0, j) = 0 for j ≥ 0 and F(i, 0) = 0 for i ≥ 0.
• Our goal is to find F(n, W), the maximal value of a

subset of the n given items that fit into the
knapsack of capacity W, and an optimal subset
itself.
67
Algorithm
vi
v
i
68
Example-1
Find the composition of an optimal subset by backtracing the computations

69
Example-1
Find the composition of an optimal subset by backtracing the computations

70
Analysis
• The classic dynamic programming approach, works
bottom up: it fills a table with solutions to all
smaller subproblems, each of them is solved only
once.
• Drawback: Some unnecessary subproblems are
also solved
• The time efficiency and space efficiency of

this algorithm are both in Θ(nW).
• The time needed to find the composition of
an optimal solution is in O(n).
72
Discussion
• The direct top-down approach to finding a solution to
such a recurrence leads to an algorithm that solves
common subproblems more than once and hence is
very inefficient.
• Since this drawback is not present in the top-down
approach, it is natural to try to combine the strengths
of the top-down and bottom-up approaches.
• The goal is to get a method that solves only subproblems
that are necessary and does so only once. Such a method
exists; it is based on using memory functions.
73
Algorithm MFKnapsack(i, j )
• Implements the memory function method for
the knapsack problem
• Input: A nonnegative integer i indicating the number of
the first items being considered and a nonnegative integer
j indicating the knapsack capacity
• Output: The value of an optimal feasible subset of the first i
items
• Note: Uses as global variables input arrays Weights[1..n],
V alues[1..n], and table F[0..n, 0..W ] whose entries are
initialized with −1’s except for row 0 and column 0
initialized
with 0’s
74
Algorithm MFKnapsack(i, j )
75
Example
76
Outline
Dynamic Trees
– General method with • Bellman-For
Examples
d Algorithm
Person problem
78
Single Source shortest path with –ve
wts
Problem definition
• Single source shortest path - Given a graph and a
source vertex s in graph, find shortest paths from s
to all vertices in the given graph.
• The graph may contain negative weight edges.
• Dijkstra’s algorithm [ O(VlogV) ], doesn’t work

for graphs with negative weight edges.
• Bellman-Ford works in O(VE)
79
Bellman Ford
•
Algorithm
Like other Dynamic Programming Problems, the
algorithm calculates shortest paths in
bottom-up manner.
• It first calculates the shortest distances
– for the shortest paths which have at-most one edge in
the path.
– Then, it calculates shortest paths with at-most 2
edges, and so on.
• Iteration i finds all shortest paths that use i edges.
80
81
82
dist1(1) = 0
dist1(2) = 6
dist1(3) = 5
dist1(4) = 5
dist1(5) = ∞
dist1(6) = ∞
dist1(7) = ∞
k=1
83
For every vertex (except source) look for
the incoming edge (except from source)
dist2(1) = 0
2 dist1(2) 6
dist (2) = min = min =3
dist1(3) + cost(3,2) 5−2
dist2(3) = min dist1(3) = min 5 =3
dist1(4) + cost(4,3) 5−2
dist2(4) = 5
dist1(5)
dist2(5) = min ∞
1
dist (2) + cost(2,5) = min6−1 = 5
5+1
2
dist1(3) + cost(3,5)
dist1(6)
∞
5−1
dist2(7) = min dist1(4) + cost(4,6)
dist1(7)
∞
dist1(5) + cost(5,7) = min ∞ + 3 =∞
∞+3
k=2
84
the
3
incoming edge (except from source)
dist (1) = 0
3 dist2(2) 3
dist2(3) + cost(3,2) 3−2
dist2(4) + cost(4,3) 5−2
dist3(4) = 5
dist2(5) 5
3
dist (5) = min dist2(2) + cost(2,5) = min 3−1 = 2
dist2(3) + cost(3,5) 3+1
dist2(4) + cost(4,6) 5−1
dist2(7)
dist3(7) = min = min ∞ 5+3 =
7
dist2(6) + cost(6,7) 4+3
k=3
85
the
4
incoming edge (except from source)
dist (1) = 0
4 dist3(2) 1
dist3(3) + cost(3,2) 3−2
dist3(4) + cost(4,3) 5−2
dist4(4) = 5
dist3(5) 2
4
dist3(3) + cost(3,5) 3+1
dist3(4) + cost(4,6) 5−1
dist3(7) 7
dist4(7) = min = min =5
dist3(5) + cost(5,7) 2+3
4+3
k=4
86
dist5(1) = 0
5 dist4(2) 1
dist4(3) + cost(3,2) 3−2
dist4(4) + cost(4,3) 5−2
dist5(4) = 5
dist4(5) 0
5
dist4(3) + cost(3,5) 3+1
dist4(4) + cost(4,6) 5−1
dist4(7) 5
dist4(5) + cost(5,7) 0+3
4+3
k=5
87
dist6(1) = 0
6 dist5(2) 1
dist5(3) + cost(3,2) 3−2
5
dist (4) + cost(4,3) 5−2
dist6(4) = 5
dist5(5) 0
6 = min 1−1 = 0
dist (5) = min dist5(2) + cost(2,5)
dist5(3) + cost(3,5) 3+1
5
dist (4) + cost(4,6) 5−1
dist5(7) 5
dist5(5) + cost(5,7) 0+3
4+3
k=6
88
89
Algorithm
90
Analysis
• Bellman-Ford works in
O(VE)
91
Example-2 Home work
Find shortest path from S to all other
vertices using Bellman Ford algorithm
92
Example-2
93
Outline
Dynamic Trees
– General method with • Bellman-Ford
Examples
Algorithm
Person problem
94
Travelling Salesman
Problem
Problem Statement
• The travelling salesman problem consists of
a salesman and a set of cities.
• The salesman has to visit each one of the cities
exactly once starting from a certain one (e.g.
the hometown) and returning to the same city.
• The challenge of the problem is that the traveling
salesman wants to minimize the total length of
the trip
• It is assumed that all cities are connected to all
other cities
95
Travelling Salesman
Problem
Naive Solution:
1. Consider city 1 as the starting and ending point.
2. Generate all (n-1)! Permutations of cities.
3. Calculate cost of every permutation and keep track
of minimum cost permutation.
4. Return the permutation with minimum cost.
Time Complexity: ?
n!
96
TSP using DP
• Assume tour to be a simple path that starts & ends at 1
• Every tour consists of
– an edge <1, k> for some k ∈ V − {1} and
– a path from vertex k to vertex 1
• The path from k to 1 goes through each vertex in V −
{1, k} exactly once
• If the tour is optimal, then the path from k to 1 must be
a shortest path going through all vertices in V − {1, k}
• Let g(i, S) be the length of a shortest path starting at
vertex i, going through all vertices in S, and
terminating at vertex 1
• g(1, V − {1}) is the length of an optimal salesperson tour
97
TSP using DP
• From the principal of
optimality
• Generalizin
g
• Example
k = 2, c + g(2,{3,4,5})
12
g(1,{2,3,4,5}) = min k = 3, c + g(3,{2,4,5})
13
k = 4, c + g(4,{2,3,5})
14
k = 5, c + g(5,{2,3,4})
15
98
Example-1
Successor of node 1: p(1,{2,3,4}) = 2

Successor of node 3: p(2, {3,4}) = 4
Successor of node 4: p(4, {3}) = 3
O p t im a l t o ur 99
Example-2 ( Home Work
)
Complete the exercise….
100
Analysis
102
Outline
• Introduction to Dynamic Programming
• Optimal Binary Search
Trees
– General method with Examples
– Multistage Graphs • Knapsack problem
• Transitive Closure: • Bellman-Ford Algorithm
– Warshall’s Algorithm, • Travelling Sales
• All Pairs Shortest Paths: Person problem
– Floyd's Algorithm, • Reliability design
103
Reliability Design
• If
the reliability of whole system
is
𝑛
𝖦 𝑟𝑖
𝑖=1
104
Reliability Design
• Let ri be the reliability of the device at stage i.

• If stage i has mi devices of type i in parallel then
reliability of stage i is
𝜑𝑖 𝑚𝑖 = 1 − (1 − 𝑟𝑖)𝑚𝑖
105
Example
• Design a 3-stage system with device types A,B,C.
There costs are 30, 15, 20 and reliability are 0.9,
0.8,
0.5 respectively. Budget available is 105. Design
a system with highest reliability.
Devices A B C
cost 30 15 20
Reliability 0.9 0.8 0.5
Maximum number of devices can be
purchased (by guaranteed purchase of u1=2 u2=3 u3=2
one unit of other devices)
Budget =105 u1= floor((105-(15+20))/30) = 2

u2= floor((105-(30+20))/15) = 3
u3= floor((105-(30+15))/20) = 2
106
Example Budget =105 𝜑𝑖 𝑚𝑖 = 1 − (1 − 𝑟𝑖)𝑚𝑖
No. of devices in A B C
llel Reliability Cost Reliability Cost Reliability Cost
0.9 0.8 0.5
1 30 15 20
m1=1 m2=1 m3=1
0.99 0.96 0.75
2 60 30 40
m1=2 m2=2 m3=2
0.992 0.875
3 - - 45 60
m2=3 m3=3
• 𝒊 - Set of all tuples of the from (f,x) generated from various sequences
𝑺
m1,of m2.. mi considering i stages where f is reliability and x is cost
• 𝑺𝒊 - i is the stage no., j is the no. of devices used at stage i
𝒋
• Example
𝟏
– 𝑺𝟏 means 1 device of type A at stage
1 𝟏
– 𝑺𝟐 means 2 device of type A at stage
1
107
# of devices in A B C
1 0.9 m1=1 30 0.8 m2=1 15 0.5 m3=1 20
2 0.99 60 0.96 m2=2 30 0.75 m3=2 40
m1=2
3 - - 0.992 m2=3 45 0.875 m3=3 60
𝑺𝟏𝟏 = 𝟎. 𝟗, 𝟑𝟎 m1=1 m1=2
𝟏
𝑺𝟏𝟐 = 𝟎. 𝟗𝟗, 𝟔𝟎 𝐶𝑜𝑚𝑏𝑖𝑛𝑖𝑛𝑔: 𝑺 = 𝟎. 𝟗, 𝟑𝟎 , 𝟎. 𝟗𝟗,
.9*.8 .99*.8 𝟔𝟎
𝑺𝟐𝟏 = 𝟎. 𝟕𝟐, 𝟒𝟓 , (𝟎. 𝟕𝟗𝟐, 𝟕𝟓)
.9*.96 .99*.96
𝑺𝟐𝟐 = (𝟎. 𝟖𝟔𝟒, For (0.9504,90) refer Note
𝟔𝟎) .9*.992 #1 .99*.992
𝑺𝟐𝟑 = 𝟎. 𝟖𝟗𝟐𝟖, 𝟕𝟓 For (0.982,105) refer Note
Note #2
#1
𝐶𝑜𝑚𝑏𝑖𝑛𝑖𝑛𝑔: 𝑺𝟐 = 𝟎. 𝟕𝟐, 𝟒𝟓 , 𝟎. 𝟕𝟗𝟐, 𝟕𝟓 , 𝟎. 𝟖𝟔𝟒, 𝟔𝟎 , 𝟎. 𝟖𝟗𝟐𝟖, 𝟕𝟓
𝑺𝟐 = 𝟎. 𝟕𝟐, 𝟒𝟓 , 𝟎. 𝟖𝟔𝟒, 𝟔𝟎 , 𝟎. 𝟖𝟗𝟐𝟖, 𝟕𝟓
m1=1 m1=1 m1=1
m2=1 m2=2 m2=3
Note #1: This configuration will not leave adequate funds to complete
No t e # 2 : F or the same c o s t , r e t a i n t h e o n e w
system H a riv in o d N 1 8C S 4 2- D e s ig n an d A na ly sis o f 108
# of devices in A B C
1 0.9 m1=1 30 0.8 m2=1 15 0.5 m3=1 20
2 0.99 60 0.96 m2=2 30 0.75 m3=2 40
m1=2
3 - - 0.992 m2=3 45 0.875 m3=3 60
𝑺𝟐 = 𝟎. 𝟕𝟐, 𝟒𝟓 , 𝟎. 𝟖𝟔𝟒, 𝟔𝟎 , 𝟎. 𝟖𝟗𝟐𝟖, 𝟕𝟓
m1=1 m1=1 m1=1
m2=1 m2=2 m2=3
𝑺𝟑𝟏 =
𝑺𝟑𝟐 =
m1=1
𝑺𝟑𝟑 = m2=1
M3 =3
𝐶𝑜𝑚𝑏𝑖𝑛𝑖𝑛𝑔: 𝑺𝟑 =
Best Reliability 0.648 with cost=100 where A -1 unit, B -1 unit, C- 2 units in ||el.
109
Assignment-4
1. Write multistage graph algorithm using
backward approach.
2. Define transitive clossure of a directed graph. Find
the transitive clossure matrix for the graph whose
adjacency matrix is given.
3. Apply bottom up dynamic programming algorithm

for the following instance of the knapsack problem.
Knapsack capacity = 10.
110
Assignment-4
4. For the given graph obtain optimal cost tour
using dynamic programming.
5. Apply Floyds algorithm to find the all pair shortest

path for the graph given below.
111

Daa M-4

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Daa M-4

Uploaded by

Copyright:

Available Formats

Design and Analysis of Algorithms

Module 4: Dynamic Programming

Difference between greedy and

cost(3,F) = min { c(F,I) + cost(4,I) | c(F,J) + cost(4,J) }

cost(2,A) = min { c(A,D) + cost(3,D) | c(A,E) + cost(3,E) }

Optimal Path: S-C-F-L

When j=5, two candidates for r, r=7,8 Cost(5) = d(5)=

When j=3, two candidates for r, r=6,7

When j=2, three candidates for r, r=6,7,8 Cost(2) = d(2)= 20

Definition: The transitive closure of a directed graph with n

2. The second possibility is that path does contain

We can generate the distance matrix with

It is called Floyd’s algorithm.

• The average number of comparisons in a

which grows to infinity as fast as 4n / n1.5

k = 1, C(1,0) + C(2,2), 0.2

How to construct the

• Our goal is to find F(n, W), the maximal value of a

Find the composition of an optimal subset by backtracing the computations

Find the composition of an optimal subset by backtracing the computations

• The time efficiency and space efficiency of

• Dijkstra’s algorithm [ O(VlogV) ], doesn’t work

• Bellman-Ford works in O(VE)

• Iteration i finds all shortest paths that use i edges.

Successor of node 1: p(1,{2,3,4}) = 2

Complete the exercise….

• Let ri be the reliability of the device at stage i.

Budget =105 u1= floor((105-(15+20))/30) = 2

3. Apply bottom up dynamic programming algorithm

5. Apply Floyds algorithm to find the all pair shortest

You might also like