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

Question 72 : Which scheme provides good performance?
1. open addressing
2. universal hashing
3. hashing by division
4. hashing by multiplication
View Answer   Discuss with Members

Question 73 : Hash tree is used in effective data verification in distributed systems.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 74 : In quadratic probing, if the table size is prime, a new element cannot be inserted if the table is half full.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 75 : In hash tables, how many traversal of links does a successful search require?
1. 1+⅄
2. 1+⅄²
3. 1+ (⅄/2)
4. ⅄³
View Answer   Discuss with Members

Question 76 : When are the members of two sets more common relatively?
1. Jaccard Index is Closer to 1
2. Jaccard Index is Closer to 0
3. Jaccard Index is Closer to -1
4. Jaccard Index is Farther to 1
View Answer   Discuss with Members

Question 77 : What data organization method is used in hash tables?
1. Stack
2. Array
3. Linked list
4. Queue
View Answer   Discuss with Members

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

Question 79 : Hashing is the problem of finding an appropriate mapping of keys into addresses.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 80 : Which technique was firstly used to remove duplicate web pages from search results in AltaVista search engine?
1. MinHash
2. Stack
3. Priority Queue
4. PAT Tree
View Answer   Discuss with Members