Home Work Number 3 Fall 2014

This is Home Work Number 3 - Questions on Divide and Conquer and Graphs - Due on 10/2/2014

Do any six of the eight problems. Last two problems are optional (for your own enjoyment)
  1. Question 2.13 a, b (DG)
  2. Question 2.14 (DG)
  3. Question 2.17 (DG)
  4. Question 2.23 b (DG)
  5. 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 20 people in 5 days.
  6. Question 2.25 a,b (DG)
  7. Question 3.1(DG)
  8. Question 3.3(DG)
  9. (Optional) Question 2.16 (If you are frustrated, you may look up Solution to problem 1 ) Please do not the answer to this problem - Just for your enjoyment.
  10. (Optional)Describe an algorithm (using divide and conquer) to find the closest points from a given set of n points in a plane. (Hint: You may want to look at wikipedia article - Please do not submit the answer to this problem - Just for your enjoyment..