This problem set covers contents of sections 15.1, and 15.2. To solve the problems you will use dynamic programming method. Dynamic programming method avoids repeated computation for same input size by storing the results in the memory, which is know as space-time tradeoff or memory-time tradeoff. This can be done using top-down recursive algorithms or bottom-up iterative algorithms. Let us use a small rod-cutting problem to illustrate a bottom-up method. The Table below shows price of a rod for a given length. Unit does not matter as long as we have prices and revenues are for the same unit of length This problem set covers contents of sections 15.1, and 15.2. To solve the problems you will use dynamic programming method. Dynamic programming method avoids repeated computation for same input size by storing the results in the memory, which is know as space-time tradeoff or memory-time tradeoff. This can be done using top-down recursive algorithms or bottom-up iterative algorithms. Let us use a small rod-cutting problem to illustrate a bottom-up method. The Table below shows price of a rod for a given length. Unit does not matter as long as we have prices and revenues are for the same unit of length