Homework 5

  • Assigned: Thursday, November 5, 2015
  • Due: Friday, November 20, 2015
  • General Instructions: 
    1. Please review the homework and grading policy outlined in the course information and homework page.
    2. Please use a cover sheet, as described in the homework page.
    3. You must also write down with whom you worked on the assignment, and any sources used.
    4. 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. Exercises 22.2-6, 22.2-7, breadth first search.
    2. Exercise 22.3-5, 22.3-11, depth-first search.
    3. Problem 23-4. Alternative minimum spanning tree algorthms.
    4. Exercise 23-1.6, 23.1-9. Minimum spanning trees.
    5. Exercise 24.1-5, 24.5-5. Shortest paths.
    6. Problem 24-4. Scaling algorithm for shortest paths.