Question

In search by hashing, we have size of the hash table and the size of list, then:

• A. Size of hash table is always smaller than size of list
• B. Size of hash table always equal to size of list
• C. Size of list is always greater than size of hashtable
• D. Size of hash table can be greater than the size of the list

Hint:

In practice, the size of the hash table is often chosen to be larger than the size of the list to optimize search and reduce the occurrence of collisions.

Answer 1

The Correct Option is D

In hashing, the size of the hash table is not necessarily restricted to be smaller than the size of the list. In fact, it is common to have the hash table's size larger than the size of the list to minimize collisions and to maintain efficient performance. By using a larger hash table, we reduce the likelihood of multiple items being hashed to the same index. Therefore, the correct answer is "Size of hash table can be greater than the size of the list."