Homework 5

  • Assigned: Thursday, Nov. 3, 2011
  • Due: Friday, November 11, 2011 (5pm in 122A mailboxes)
  • Required for Undergraduates: 4 of the following 5 problems 
  • Required for Graduate Students: 4 of the following 5 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. On each problem, you must also write down with whom you worked on the assignment.
  3. Start early, be concise but rigorous, and enjoy!
  • Specific Instructions:
  1. Be sure to review any parts of Chapters 17 and 22 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 17.2-1. Copying a stack.
  2. Problem 17-2. Making binary search dynamic.
  3. Exercises 22.2-6, 22.2-7, breadth first search.
  4. Exercise 22.3-5, 22.3-11, depth-first search.
  5. Exercise 22.5-3, 22.5-5 Strongly connected components.
  6. Exercises 22.1-4, Exercise 23.1-6. Minimum Spanning Trees.