Question: Assume a hash table which uses linear probing. The hash table P has Q elements, and uses r as an index. ris defined by the
Assume a hash table which uses linear probing. The hash table P has Q elements, and uses r as an index. ris defined by the hash function r = s(key). When we make a particular entry, we find that Pld is already full. Where should our system make its next attempt to store the element? P[s(r) +1] OP[r+1 mod Q] O In the next element of the secondary container at PC OP[Q+1 modi]
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
