Question 31 : Which of the following is a disadvantage of using separate chaining using linked lists?
1. It requires many pointers
2. It requires linked lists
3. It uses array
4. It does not resolve collision
View Answer   Discuss with Members

Question 32 : In the following given hash table, use linear probing to find the location of 49.

0
1
2
3
4
5
6
7
8	18
9	89

1. 7
2. 6
3. 2
4. 0
View Answer   Discuss with Members

Question 33 : What is the hash function used in Double Hashing?
1. (h1(k) - i*h2(k))mod m
2. h1(k) + h2(k)
3. (h1(k) + i*h2(k))mod m
4. (h1(k) + h2(k))mod m
View Answer   Discuss with Members

Question 34 : ___________ is not a theoretical problem but actually occurs in real implementations of probing.
1. Hashing
2. Clustering
3. Rehashing
4. Collision
View Answer   Discuss with Members

Question 35 : Which of the following schemes does quadratic probing come under?
1. rehashing
2. extended hashing
3. separate chaining
4. open addressing
View Answer   Discuss with Members

Question 36 : Which of the following is not a collision resolution strategy for open addressing?
1. Linear probing
2. Quadratic probing
3. Double hashing
4. Rehashing
View Answer   Discuss with Members

Question 37 : Who invented the MinHash technique?
1. Weiner
2. Samuel F. B. Morse
3. Friedrich Clemens Gerke
4. Andrei Broder
View Answer   Discuss with Members

Question 38 : What is the value of m' if the value of m is 19?
1. 11
2. 18
3. 17
4. 15
View Answer   Discuss with Members

Question 39 : What is the time complexity to delete an element from the direct address table?
1. O(n)
2. O(logn)
3. O(nlogn)
4. O(1)
View Answer   Discuss with Members

Question 40 : Which hash function satisfies the condition of simple uniform hashing?
1. h(k) = lowerbound(km)
2. h(k)= upperbound(mk)
3. h(k)= lowerbound(k)
4. h(k)= upperbound(k)
View Answer   Discuss with Members