1.Consider hashing with a table size of 100 and a hash functionof key%tablesize. Insert 25 keys. Do you expect to see anycollisions? Why or why not?
| Yes, because random values likely will land on samelocations. |
| No becase there are four times as many slots as needed. |
2. Secondary clustering means that elements that hash to thesame position will probe to the same alternate cells.
Simple hashing uses key%tablesize as the hash function.
Which of the following sequence of insertions would demonstratesecondary clustering of quadratic probing if the tablesize is100?
| Secondary clustering is unlikely with quadratic probing. |
3.Using double hashing (as the Collision Resolution technique),consider inserting multiple copies of the same value Is thereclustering?
| The table is large enough there is little chance forcollision. |
| Because neighbors are not used for overflow, clustering doesnot occur. |
| Each key has a unique step function. |
| There is clustering. It is impossible to prevent. |
4. Consider the following collision resolution scheme: You uselinear probing, but always increment by 3 (rather than 1) in theevent of a collision.
Which is true of this method?
