This preview shows page 1. Sign up to view the full content.
Unformatted text preview: that you will analyse. You are allowed to collaborate with other students on these problems. But, the write ups should be written by yourself without help from others. If you have any questions regarding how these guidelines apply to a particular problem or what they mean in general please post on the newsgroup or email the TAs. Put each homework problem on a separate sheet of paper and place your name on every sheet. Problem 1 Generalize the medianFnding algorithm to Fnd the k th largest item in a set of n items for any given value of k . Prove that your resulting algorithm is correct and bound its running time. Problem 2 Excercise 3.7 from the book. Hint: Write the price of the stock on day d as a product of d random variables. Problem 3 Excercise 3.20 from the book....
View
Full
Document
This document was uploaded on 11/03/2009.
 Spring '09

Click to edit the document details