Question

1. What is the difference between divide-and-conquer, dynamic programming and memory function algorithms? Describe their differences in detail(6pt) 2. 0-1 Knapsack Problem: Assume the weigh and the value of 5 items are given below. The maximum capacity of the knapsack $W_{max} = 6$ Item weight Value 1 3 $25 2 2 $20 3 1 $15 4 4 $40 5 5 $50 a) Using the standard dynamic programming algorithm, compute the maximum profit by showing detailed steps(4pt) b) Identify the items that are selected to produce the maximum profit in (a) (2pt). c) Using the refined dynamic programming algorithm, compute the maximum profit by showing detailed steps(4pt) d) Identify the items that are selected to produce the maximum profit in (c) (2pt) e) When we compare the time complexity of standard dynamic programming and refined dynamic programming algorithm, which one is efficient? Explain your reason(2pt)

          1. What is the difference between divide-and-conquer, dynamic programming and
memory function algorithms? Describe their differences in detail(6pt)
2. 0-1 Knapsack Problem: Assume the weigh and the value of 5 items are given
below. The maximum capacity of the knapsack $W_{max} = 6$
Item weight Value
1 3 $25
2 2 $20
3 1 $15
4 4 $40
5 5 $50
a) Using the standard dynamic programming algorithm, compute the maximum
profit by showing detailed steps(4pt)
b) Identify the items that are selected to produce the maximum profit in (a) (2pt).
c) Using the refined dynamic programming algorithm, compute the maximum profit
by showing detailed steps(4pt)
d) Identify the items that are selected to produce the maximum profit in (c) (2pt)
e) When we compare the time complexity of standard dynamic programming and
refined dynamic programming algorithm, which one is efficient? Explain your
reason(2pt)

1. What is the difference between divide-and-conquer, dynamic programming and
memory function algorithms? Describe their differences in detail(6pt)
2. 0-1 Knapsack Problem: Assume the weigh and the value of 5 items are given
below. The maximum capacity of the knapsack Wmax = 6
Item weight Value
1 3 25
2 220
3 1 15
4 440
5 5 50
a) Using the standard dynamic programming algorithm, compute the maximum
profit by showing detailed steps(4pt)
b) Identify the items that are selected to produce the maximum profit in (a) (2pt).
c) Using the refined dynamic programming algorithm, compute the maximum profit
by showing detailed steps(4pt)
d) Identify the items that are selected to produce the maximum profit in (c) (2pt)
e) When we compare the time complexity of standard dynamic programming and
refined dynamic programming algorithm, which one is efficient? Explain your
reason(2pt)

Added by Phillip H.

Question

Please give Ace some feedback