CS 4349: Algorithms
Spring 2008
Assignment 3

Due: Monday, February 11 (in class)


1. Consider the assembly-line scheduling problem in Section 15.1.
   We modify the problem as follows.  Suppose the fastest
   time through the factory takes 38 time steps.  There may be
   many solutions which achieve this minimum value, and each of these
   solutions may switch lines a different number of times.  Say, it is
   preferable to switch lines fewer number of times than more.  Show how
   to modify the algorithm FASTEST-WAY (page 329) so that among
   the fastest solutions through the factory, we find the one
   that switches lines least number of times.

2. Ex. 15.2-1 (page 338)  [1st ed: 16.1-1, p. 308].  MCM example.

3. Ex. 15.4-3 (page 356)  [1st ed: 16.3-3, p. 319].  Memoized LCS.

4. Ex. 15.4-5 (page 356)  [1st ed: 16.3-5, p. 319].  LMS problem.
   Solve this problem from first principles without using LCS
   as a subroutine.