CS410, Summer 1998
Quiz #7
July 16

Consult no sources.				Name:

1. When transforming strings to ints, why don't we just base our transformation
on the first 6 characters?

2. When hashing by the division method, what table sizes are appropriate?

3. When hashing by the multiplication method, what table sizes are
appropriate?

4. For any hash function, some set of keys will all collide.  How does
universal hashing get around this unfortunate fact of life?

ANSWERS
=======

1. Strings with the same first six characters would collide.

2. Prime numbers away from powers of 2.

3. Powers of 2.

4. Picking randomly from a large set of good hash functions.

(2.5 points each)