Homework 7

  • Assigned: Monday, November 30, 2009
  • Due: Monday, December 14, 2009 (5pm in 122A mailboxes)
  • Required for Undergraduates: 5 of the following 8 problems 
  • Required for Graduate Students: 6 of the following 8 problems 
  • Points: 10 pts per problem
  • General Instructions: 
  1. Please review the homework and grading policy outlined in the course information and homework page.
  2. Turn in problems separately, based on the signs on the mailboxes in 122A.  DO NOT staple separate problems to one another.
  3. Submit the solutions on a standard A4/letter paper. 
  4. Either type the homework (e.g. using the formatting software called latex), OR,  where applicable, if   written on paper, circle your answers. (running times, true/false, etc.)
  5. For each problem:
        - Staple pages belonging to a single problem.
        - Write UNI and name.
        - Indicate your professor's name (Stein or Monteleoni).
        - Write EC/RC on each problem.
  6. On each problem, you must also write down with whom you worked on the assignment.
  7. Start early, be concise but rigorous, and enjoy!
  • Specific Instructions:
  1. All logs are base 2 unless otherwise specified.
  2. Unless otherwise specified, all problems and exercises are from CLRS, Introduction to Algorithms, 3rd edition.
  • Problems:  
    1. Exercise 26.1-2. Multiple Source, multiple sink network.
    2. Exercise 26.2-10. Flow on E paths
    3. Problem 26-4. Updating a max flow
    4. Exercise 29.2-5, 29.2-7. Formulating linear programs.
    5. Problem 29-1. Linear-inequality feasibility.
    6. Exercise 34-1.5 Calling subroutines
    7. Exercise 34.5-2, 34.5-3.. Integer linear programming
    8. Problem 34-2. Bonnie and Clyde