CSCI 2300 Home Work 8

This Home work is on Dynamic Programming Problems Chapter 6 of DG and one problem from CLRS (third edition)Chapter 15 Due on November 3rd
  1. Problem 6.2 (DG)
  2. Pronlem 6.10 (DG) Hint: P(i,j) = probaility of having exactly j heads with 1,..i coins.
  3. Problem 6.17 (DG) Hint similar to knapsack problem.
  4. Problem 15.1-3 (page 370) Consider a modification of the rod-cutting prolem in which in addition to a price pi for each rod, each cut incurs a fixed cost c. The revenue associated with a solution is now the sum of prices of th epieces minus the cost of making the cuts. Give a dynamic programming algorithm to solve this modified problem (Please read section 15.1 of CLRS book).