Homework 6

  • Assigned: Tuesday, November 15, 2011
  • Due: Tuesday, November 29, 2011 (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. Start early, be concise but rigorous, and enjoy!
  • Specific Instructions:
  1. Be sure to review any parts of Chapters 23-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. Exercise 24.1-6. 24.5-6. Bellman-Ford.
    2. Exercise 24.3-5. Exercise 24.3-8. Dijkstra.
    3. Problem 24-4. Scaling algorithm for shortest paths.
    4. Problem 25-2 Shortest paths in epsilon-dense graphs