COMS 4231 02F: Homework 2

Assigned: Thursday, September 19, 2002
Due: Wednesday, October 2, 2002

Required: 7 of the following 9 problems
Points: 10 pts per problem

General Instructions

  1. Please review the homework and grading policy outlined in the course information page.

  2. On the first page of your solution write-up, you must make explicit which problems are to be graded for "regular credit", which problems are to be graded for "extra credit", and which problems you did not attempt. Please use a table something like the following

    Problem01020304 0506070809...
    CreditRCRCRCECRC RCNARCRC...

    where "RC" is "regular credit", "EC" is "extra credit", and "NA" is "not attempted" (not applicable). Failure to do so will result in an arbitrary set of problems being graded for regular credit, no problems being graded for extra credit, and a five percent penalty assessment.

  3. You must also write down with whom you worked on the assignment. If this changes from problem to problem, then you should write down this information separately with each problem.
  4. Start early, be concise but rigorous, and enjoy!

Specific Instructions

  1. Be sure to review the appendix on probability if your background is weak.
  2. All logs are base 2 unless otherwise specified.
  3. Unless otherwise specified, all problems and exercises are from CLRS, Introduction to Algorithms, 2nd edition.

Problems

  1. Exercise 8.3-4. Sorting numbers from 0 to n^2 - 1.
  2. Problem 8-2. Sorting in place.
  3. Problem 8-4. Water jugs
  4. Problem 8-6. Lower bound on merging.
  5. Exercise 9.1-2. Lower bound on min and max.
  6. Exercise 9.3-1. Alternative group sizes for selection.
  7. Problem 9-2. Weighted median.
  8. Exercise 9.3-8. Median from 2 sorted lists.
  9. Exercises 5.2-4 and 5.2-5. Indicator random variables.


Switch to:


cliff@ieor.columbia.edu