91. Which of the following is true for a Hash tree?
92. What is the value of 'm' if the value of m is 19?
93. What is the load factor?
94. What is the time complexity of insert function in a hash table using list head?
95. What is the worst case search time of a hashing using separate chaining algorithm?
96. Which scheme uses a randomization approach?
97. Which of the following technique stores data in a separate entity in case of a collision?
98. Which technique was firstly used to remove duplicate web pages from search results in AltaVista search engine?
99. What is the advantage of hashing with chaining?
100. Hash tree is used in data synchronisation. In the worst case the data synchronisation takes . . . . . . . . time.
Read More Section(Hashing)
Each Section contains maximum 100 MCQs question on Hashing. To get more questions visit other sections.
