CS5800 09F: Homework 07

Assigned: Wed 04 Nov 2009
Due: Wed 18 Nov 2009

Instructions

1. Please review the course syllabus and make sure that you understand the course policies for grading, late homework, and academic honesty.

2. On the first page of your solution write-up, you must make explicit which problems are to be graded for "regular credit", which problems are to be graded for "extra credit", and which problems you did not attempt. Please use a table something like the following

   Problem	01	02	03	04	05	06	07	08	09	...
   Credit	RC	RC	RC	EC	RC	RC	NA	RC	RC	...

   where "RC" is "regular credit", "EC" is "extra credit", and "NA" is "not applicable" (not attempted). Failure to do so will result in an arbitrary set of problems being graded for regular credit, no problems being graded for extra credit, and a five percent penalty assessment.

3. You must also write down with whom you worked on the assignment. If this changes from problem to problem, then you should write down this information separately with each problem.

Problems

Required:

• problem 1 (20 points)
• one of problems 2 and 3 (20 points each)
• all of problems 4, 5, 6, 7, 8 (10 points each)
• one of problems 9 and 10 (20 points each).

1. Read the Wikipedia article on Bloom filters: http://en.wikipedia.org/wiki/Bloom_filter

   and then consider what happens if you fix the length of the bit array at m bits, but you allow the number of hash functions, k, to vary.

   1. What goes wrong in the extreme limit when k becomes large?
   2. What goes wrong in the extreme limit when k becomes 1?
2. 17.3-6
3. 17.3-7

Read chaper 12 - Binary trees

4. 12.1-1
5. 12.2-1
6. 12.2-2
7. 12.2-4
8. 12.3-4 (CLRS-3ed) = 12.3-5 (CLRS-2ed)
9. 12.1
10. 12.4

Switch to:

• CS5800 F09 Home Page
• Homework 6
• Homework 8