Consider a hashing function that resolves collision by quadratic probing. Assume the address space to be indexed from 1 to 8. If a collision occurs at position 4, which of the following locations will never be probed?

Keep practicing — related questions

• Which of the following is a hash function?
• A hash table of length 10 uses open addressing with hash function h(k)=k mod 10, and linear probing. After ...
• In which of the following hashings, the hash functions are describe as h2(key) is not equal to zero and h2 ...
• A set of values (23, 18, 29, 28, 39, 13, 16, 42, 17) are stored in an array having 11 locations (array inde...
• A hash table of length 10 uses open addressing with hash function h(k)=k mod 10, and linear probing. After ...
• The keys 12, 18, 13, 2, 3, 23, 5 and 15 are inserted into an initially empty hash table of length 10 using ...
• The keys 12, 18, 13, 2, 3, 23, 5 and 15 are inserted into an initially empty hash table of length 10 using ...
• A hash table can store a maximum number of 10 records, currently there are records in locations 1, 3, 4, 7,...