Question 61 : What is the hash function used in the division method?
1. h(k) = k/m
2. h(k) = k mod m
3. h(k) = m/k
4. h(k) = m mod k
View Answer   Discuss with Members

Question 62 : Which technique has the greatest number of probe sequences?
1. Linear probing
2. Quadratic probing
3. Double hashing
4. Closed hashing
View Answer   Discuss with Members

Question 63 : What is the running time of double hashing?
1. Theta(m)
2. Theta(m²)
3. Theta(m log k)
4. Theta(m³)
View Answer   Discuss with Members

Question 64 : Which technique was firstly used clustering documents using the similarity of two words or strings?
1. MinHash
2. Stack
3. Priority Queue
4. PAT Tree
View Answer   Discuss with Members

Question 65 : At what position the number 72 gets inserted in the following table?

Index	Key
0	22
1	34
2
3
4
5	56
6
7	18
8	41
9
10

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

Question 66 : How is a bit vector better compared to a normal array for implementing the hash table?
1. It saves time
2. It saves space
3. It saves both time and space
4. None of the mentioned
View Answer   Discuss with Members

Question 67 : On what value does the probe sequence depend on?
1. c1
2. k
3. c2
4. m
View Answer   Discuss with Members

Question 68 : What is the average retrieval time when n keys hash to the same slot?
1. Theta(n)
2. Theta(n²)
3. Theta(nlog n)
4. Big-Oh(n²)
View Answer   Discuss with Members

Question 69 : What is the load factor for an open addressing technique?
1. 1
2. 0.5
3. 1.5
4. 0
View Answer   Discuss with Members

Question 70 : What is the hash function used in linear probing?
1. H(x)= key mod table size
2. H(x)= (key+ F(i²)) mod table size
3. H(x)= (key+ F(i)) mod table size
4. H(x)= X mod 17
View Answer   Discuss with Members