Homework 3

  • Assigned: Thursday, October 8, 2015
  • Due: Friday, October 23, 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.
  3. For a dynamic programming problem, be sure to
    • prove that optimal substructure exists
    • say in words what your variables are computing
    • give a recurrence
    • give non-recursive pseudocode
  • Problems:
  • Problem 9-4. Randomized Selection Analysis
  • Problem 7-5. Median of 3 partition.
  • Exercises 15.2-1 and 15.2-3. Matrix Chain Multiplication.
  • Exercise 15.4-4 and 15.4-5. Longest Common Subsequence.
  • Problem 15-9. Breaking a String.
  • Problem 15-11. Inventory Planning.