1.Using double hashing (as the Collision Resolution technique), consider inserting multiple copies of the same value Is there clustering?

Because neighbors are not used for overflow, clustering does not occur.

Each key has a unique step function.

There is clustering. It is impossible to prevent.

2.Consider the following collision resolution scheme: You have 10 completely different hash functions. If the first method produces a collision, you try the second, and so on until you find a spot or until all hash functions are exhausted. At that point, the hash fails and you will need to rehash.

Which is true of clustering using this method?

non-clustering

primary clustering

3.Consider the following collision resolution scheme: You have an overflow area at the bottom of the table. Instead of using linear probing (placing items that wont fit in the desired location in the next open space), you put all items that wont fit in the computed address in this overflow area (sequentially).

Which describes this method?

secondary clustering

primary clustering

This question might have multiple answers please keep that in mind

4.What collisions resolution method could be described as follows" It is similar to linear probing, except that, instead of just trying one index ahead each time until it finds an empty index, it takes bigger and bigger steps each time. (Select all that apply.)

Super linear probing

None of the others

Double hashing

Quadratic probing