Home Work Number 3 Spring 2015
This is Home Work Number 3 - Questions on Divide and Conquer and Graphs and DFS (Chapter 3 of DG) - Due on 3/12/2015
Do any six problems. Last two problems are optional (for your own enjoyment)
- Question 2.13 a, b (DG)
- Question 2.14 (DG)
- Question 2.17 (DG)
- 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 24 people in 5 days.
- Question 2.25 a,b (DG)
- Question 3.7(DG)
- Question 3.8(DG)
- Question 3.9 (DG)
- Question 3.11 (DG)
- Question 3.12(DG)
- (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.
- (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..