some of these questions have multiple answers please consider that.

1. 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

secondary clustering

primary clustering

2. 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.)

Linked List Chaining

Super linear probing

None of the others

Double hashing

Quadratic probing

non-clustering

secondary 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

non-clustering

4. Consider the following hashing situation: The hash table has a size of 2,047. The search keys are identifier names in C++. The hash function is

h(key)=(position of the first letter of key in alphabet)%size

Which is true of the hashing function (select all that apply)?

minimizes collisions

utilizes a wide range of values between 0 and the size of the table

is repeatable

fast to compute