Question 51 : If several elements are competing for the same bucket in the hash table, what is it called?
1. Diffusion
2. Replication
3. Collision
4. None of the mentioned
View Answer   Discuss with Members

Question 52 : Which indicator is used for similarity between two sets?
1. Rope Tree
2. Jaccard Coefficient
3. Tango Tree
4. MinHash Coefficient
View Answer   Discuss with Members

Question 53 : In linear probing, the cost of an unsuccessful search can be used to compute the average cost of a successful search.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 54 : Sequential access in a Hash tree is faster than in B-trees.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 55 : Which of the following operations are done in a hash table?
1. Insert only
2. Search only
3. Insert and search
4. Replace
View Answer   Discuss with Members

Question 56 : The value of h2(k) can be composite relatively to the hash table size m.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 57 : What should be the load factor for separate chaining hashing?
1. 0.5
2. 1
3. 1.5
4. 2
View Answer   Discuss with Members

Question 58 : For the given hash table, in what location will the element 58 be hashed using quadratic probing?

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

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

Question 59 : What is the advantage of the multiplication method?
1. only 2 steps are involved
2. using constant
3. value of m not critical
4. simple multiplication
View Answer   Discuss with Members

Question 60 : The case in which a key other than the desired one is kept at the identified location is called?
1. Hashing
2. Collision
3. Chaining
4. Open addressing
View Answer   Discuss with Members