Created: Sun 01 Nov 2009
Wed 04 Nov 2009
Wed 18 Nov 2009
- Please review the course syllabus and make sure that you understand the course policies for grading, late homework, and academic honesty.
- 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
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
- 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.
- 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).
Unless otherwise indicated, exercises and problems are from Introduction to Algorithms by Cormen, Leiserson, Rivest, and Stein. The edition (2nd or 3rd) will be indicated if the numbering differs.
- Read the Wikipedia article on Bloom filters:
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.
- What goes wrong in the extreme limit when k becomes large?
- What goes wrong in the extreme limit when k becomes 1?
Read chaper 12 - Binary trees
- 12.3-4 (CLRS-3ed) = 12.3-5 (CLRS-2ed)
College of Computer Science, Northeastern University
360 Huntington Avenue #340 WVH,
Boston, MA 02115
Phone: (617) 373-2198 / Fax: (617) 373-5121
The URL for this document is: