Question 21 : How many constraints are to be met to successfully implement quadratic probing?
1. 1
2. 2
3. 3
4. 4
View Answer   Discuss with Members

Question 22 : Which of the following is not a collision resolution technique?
1. Separate chaining
2. Linear probing
3. Quadratic probing
4. Hashing
View Answer   Discuss with Members

Question 23 : What is the search complexity in direct addressing?
1. O(n)
2. O(logn)
3. O(nlogn)
4. O(1)
View Answer   Discuss with Members

Question 24 : Which of the following is true for a Hash tree?
1. Hashing is used for sequential access
2. Indexing is used for direct access
3. Hash tree allows only sequential access
4. Hashing is used for direct access
View Answer   Discuss with Members

Question 25 : Which of the following is the correct function definition for quadratic probing?
1. F(i)=i²
2. F(i)=i
3. F(i)=i+1
4. F(i)=i²+1
View Answer   Discuss with Members

Question 26 : Hash tree is generalization of ______
1. Heap
2. Hash list
3. BST
4. B – tree
View Answer   Discuss with Members

Question 27 : Hashing can be used in online spelling checkers.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 28 : Which of the following is the hashing function for separate chaining?
1. H(x)=(hash(x)+f(i)) mod table size
2. H(x)=hash(x)+i² mod table size
3. H(x)=x mod table size
4. H(x)=x mod (table size * 2)
View Answer   Discuss with Members

Question 29 : In a hash table of size 10, where is element 7 placed?
1. 6
2. 7
3. 17
4. 16
View Answer   Discuss with Members

Question 30 : What can be the techniques to avoid collision?
1. Make the hash function appear random
2. Use the chaining method
3. Use uniform hashing
4. All of the mentioned
View Answer   Discuss with Members