Home Work Number 4 Fall 2011

This is Home Work Number 4 - Questions on Divide and Conquer and Graphs - Due on 9/29/2011

Do the following five problems.
  1. Question 2.13 a, b (DG)
  2. Question 2.14 (DG)
  3. Question 2.23 b (DG)
  4. In class, we discussed gossip monger's problem (or how to spread rumors fast). Here is a refernce to a paper which discusses this problem. Your assignment is to spread the rumor among 18 people in 5 days.
  5. Question 3.1(DG)
  6. (Optional) 2.17 (DG) Please do not submit the answer to this problem - Just for your enjoyment..
  7. (Optional) Please read the paper and understand the algorithm to find the plurality of given set of n numbers (a number that occurs maximum number of times - If there are multiple numbers (that occur a maximum number of times, you can select any one). Plurality . In the next lab you may be implementing to this algorithm (section 3).