Introduction to Algorithms
October 1, 2001
Massachusetts Institute of Technology
6.046J/18.410J
SingaporeMIT Alliance
SMA5503
Professors Erik Demaine, Lee Wee Sun, and Charles E. Leiserson
Handout 14
Problem Set 4
MIT students:
This problem set is due in recitation on
Friday, October 5
.
SMA students:
This problem set is due after the recitation session on
Friday, October 5
.
Reading:
Chapters 10 and 11
Both exercises and problems should be solved, but
only the problems
should be turned in.
Exercises are intended to help you master the course material. Even though you should not turn in
the exercise solutions, you are responsible for material covered by the exercises.
Mark the top of each sheet with your name, the course number, the problem number, your
recitation instructor and time, the date, and the names of any students with whom you collaborated.
MIT students:
Each problem should be done on a separate sheet (or sheets) of threehole punched
paper.
SMA students:
Each problem should be done on a separate sheet (or sheets) of twohole punched
paper.
You will often be called upon to “give an algorithm” to solve a certain problem. Your writeup
should take the form of a short essay. A topic paragraph should summarize the problem you are
solving and what your results are. The body of your essay should provide the following:
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
This is the end of the preview.
Sign up
to
access the rest of the document.
 Spring '01
 CharlesE.Leiserson
 Algorithms, hash function, Bloom filter, Hash functions

Click to edit the document details