CSCI 2300 Lab 8 Fall 2011, 11/2/11

This lab is about Dynamic Programming
  1. 6.1 (DG) - Design an algorithm to solve this problem. Implement that algorithm, (Hint: You may want to have variables runningsum and bestmax. If runningsum > bestmax then replace bestmax by running sum. if running sum is < 0 then you may want to reset runningsum to zero. Increase the index of the array). Outputting the contiguous subsequence is optional.) use the data from the book for testing.
  2. 6.3 (DG) Your instructor has written a code lab2011-8-2.cc and Sample Data2. Your job is to study the code and write the formulation for Dynamic Porgramming in terms of the following equations - given m[i], profit[i], write the equation for finding max_expected profit if one places a Yuckdonald in ith location.
  3. (optional) Get help for your home work problems.