Homework 2

  • Assigned: Thursday, September 24, 2015
  • Due: Friday, October 9, 2015
  • General Instructions: 
  1. Please review the homework and grading policy outlined in the course information and homework page.
  2. You must also write down with whom you worked on the assignment, and any sources used.
  3. 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 6.5-9. Merging k sorted lists
  2. Problem 6-3. Young tableaus
  3. Problem 8.6. Lower bounds on merging sorted lists
  4. Exercise 9.3-6. Quantiles and Exericise 9.3.8. Median of 2 sorted lists.
  5. Problem 9.2. Weighted Median.
  6. Exercises 5.3-2, 5.3-4, 5.3-5. Random Permutations.