41. What is the load factor for an open addressing technique?
42. By implementing separate chaining using list head we can reduce the number of collisions drastically.
43. A hash table may become full in the case when we use open addressing.
44. . . . . . . . . is not a theoretical problem but actually occurs in real implementations of probing.
45. What is the disadvantage of hashing with chaining?
46. What is the worst case time complexity of insert function in the hash table when the list head is used for chaining?
47. In linear probing, the cost of an unsuccessful search can be used to compute the average cost of a successful search.
48. Which of the following is the correct function definition for linear probing?
49. What kind of deletion is implemented by hashing using open addressing?
50. In a hash table of size 10, where is element 7 placed?
Read More Section(Hashing)
Each Section contains maximum 100 MCQs question on Hashing. To get more questions visit other sections.