Homework 4

  • Assigned: Thursday, October 22, 2015
  • Due: Friday, October 30, 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. Exercise 16.2-7. Maximizing a payoff. Be sure to prove that the greedy choice property holds.
    2. Problem 16-2. Scheduling. Be sure to prove that the greedy choice proprety holds.
    3. Problem 17-2. Making Binary Search Dynamic. For part b, please choose 2 of three methods to perform that amortized analysis. For part c, do more than discuss. Please give pseudocode for delete and analyze the running time.