List of top Computer Science and IT Engineering Questions on Hashing

The keys 5, 28, 19, 15, 26, 33, 12, 17, 10 are inserted into a hash table using the
hash function β„Ž(π‘˜) = π‘˜ π‘šπ‘œπ‘‘ 9. The collisions are resolved by chaining. After all
the keys are inserted, the length of the longest chain is __________. (answer in
integer)

Consider a hash table 𝑃[0, 1, … , 10] that is initially empty. The hash table is
maintained using open addressing with linear probing. The hash function used is
β„Ž(π‘₯) = (π‘₯+ 7) mod 11.
Consider the following sequence of insertions performed on 𝑃:
1, 13, 22, 15, 11, 24
Which of the following positions in the hash table is/are empty after these insertions
are performed?