Computer Sciences > GATE 2026 SET-1 > Hashing
Consider a hash table P[0, 1, …, 10] that is initially empty. The hash table is maintained using open addressing with linear probing. The hash function used is h(x) = (x + 7) mod 11.
Consider the following sequence of insertions performed on P:
1, 13, 22, 15, 11, 24
Which of the following positions in the hash table is/are empty after these insertions are performed?
Consider the following sequence of insertions performed on P:
1, 13, 22, 15, 11, 24
Which of the following positions in the hash table is/are empty after these insertions are performed?
Correct : a,b
Similar Questions
Consider a double hashing scheme in which the primary hash function is h1(k) = k mod 23, and the secondary hash function is h2(k) = 1+(k mod 19). Assume that th...
Which one of the following hash functions on integers will distribute keys most uniformly over 10 buckets numbered 0 to 9 for i ranging from 0 to 2020?
Consider a hash table with 9 slots. The hash function is h(k) = k mod 9. The collisions are resolved by chaining. The following 9 keys are inserted in the order...
Total Unique Visitors
Loading......