Homework 6

  • Assigned: Friday, November 13, 2009
  • Due: MONDAY, November 30, 2009 (5pm in 122A mailboxes)
  • Required for Undergraduates: 5 of the following 7 problems 
  • Required for Graduate Students: 6 of the following 7 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. Be sure to review any parts of Chapters 22-26 with which you are not familiar.
  2. All logs are base 2 unless otherwise specified.
  3. Unless otherwise specified, all problems and exercises are from CLRS, Introduction to Algorithms, 3rd edition.
  • Problems:  
  1.    a) Exercise 22.5-4
       b) Exercise 23.1-7
       c) Exercise 23.1-10
  2.  Problem 23-4. Alternative MST algorithms
  3.  a) Exercise 24.3-8
     b) Exercise 24.3-9
  4.  a) Exercise 24.3-7
     b) Exercise 24.5-7
  5. Problem 24-1. Yen's improvement to Bellman-Ford
  6.    a) Exercise 25.1-4
       b) Exercise 25.2-6
  7. Problem 25-2 Shortest paths in epsilon-dense graphs