Reference no: EM131636600

Question: A disadvantage of hashing with linear probing for collision resolution is that elements begin to cluster together in groups of adjacent array locations. Assume that you have a very good hashing function (it distributes elements evenly throughout the hash table). Start with an empty hash table of size t that will store data using linear probing for collision resolution.

a. What is the probability of hashing the first element to location p (and storing it there, since it is the first item and there will be no collisions)?

b. Once location p is occupied, what is the probability of storing the second item in location p + 1 (modulo the table size)?

c. Once locations p and p + 1 are occupied, what is the probability of storing the third item in location p + 2 (modulo the table size)?