A hash table may become full in the case when we use open addressing. – McqOptions

MCQOPTIONS

1.	A hash table may become full in the case when we use open addressing.
A.	true
B.	false
Answer» B. false

Discussion

No Comment Found

Related MCQs

Which of the following is an advantage of open addressing over separate chaining?
By implementing separate chaining using list head we can reduce the number of collisions drastically.
Which of the following technique is used for handling collisions in a hash table?
What is the worst case time complexity of insert function in the hash table when the list head is used for chaining?
What is the advantage of using linked list over the doubly linked list for chaining?
A hash table may become full in the case when we use open addressing.
What is the time complexity of delete function in the hash table using list head?
What is the time complexity of search function in a hash table using list head?
What is the time complexity of insert function in a hash table using list head?
Which of the following trait of a hash function is most desirable?