Home Work Number 3 Fall 2011

This is Home Work Number 3 (Due September 22)- Questions on RSA, Chapter 2 of Das Gupta (DG) et al's book and Cormen et al's book(CLRS) Chapter 4

  1. Question 1.27 (DG)
  2. Question 2.3 a and b (DG)
  3. Question 2.5 c and g (DG)
  4. Question 2.12
  5. (optional)Exercise 4.1.5 (CLRS) - read Section 4.1 of CLRS (third edition) - Wikipedia Article on Maximum subarray problem - You need not submit the solution for this problem when you submit your homework solution. Here is a nice write up by Bentley Dr. Bentley You may need this for the next lab.
Home Work Number 4

Home Work Number 4 Fall 2010

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

Do the following five problems.
  1. Question 2.13 a, b (DG)
  2. Question 2.17 (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 14 people in 4 days.
  5. Question 3.2 (DG)
  6. (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..