1. Duplicate hash codes for objects o1 and o2 where !o1.equals(o2)

a. cause collisions

b. map to different indices in the hash table

c. cannot be stored in a hash table

d. require rehashing of all elements in the hash table

2. If a search keys data type is _____ you can use the key itself as the hash code.

a. double

b. String

c. float

d. int

3. Finding an unused location in the hash table is called

a. None of these

b. hash searching

c. free spot detection

d. open addressing