Homework 4
The homework is due at the start of class on Wednesday, April 15.
Everyone in 3510 and 3511:
(All problems are from [DPV]:)
-
Problem 6.3
- a) Carefully state what subproblems (smaller problems of the same type) you will solve.
- b) Determine the base cases.
- c) Carefully state the recursion.
- d) Then write the dynamic program in simple pseudo-code.
- e) Show what the optimal solution is if k=4 and the expected profits
at successive mile
markers are: 1, 3, 5, 3, 7, 4, 4, 3, 8, 2, 1, 5, 3, 3, 2, 5, 3.
-
Problem 8.4
-
Problem 8.9
-
Problem 8.10, (parts a -- e only) (20 points)
-
Problem 8.12
-
Problem 8.18