We have the best collection of Min Hash MCQs and answer with FREE PDF. These Min Hash MCQs will help you to prepare for any competitive exams like: BCA, MCA, GATE, GRE, IES, PSC, UGC NET, DOEACC Exams at all levels – you just have to practice regularly.
Min Hash MCQs
1. Which technique was firstly used clustering documents using the similarity of two words or strings?
a) MinHash
b) Stack
c) Priority Queue
d) PAT Tree
Answer: MinHash
2. Which indicator is used for similarity between two sets?
a) Rope Tree
b) Jaccard Coefficient
c) Tango Tree
d) MinHash Coefficient
Answer: Jaccard Coefficient
3. Which of the following is defined as the ratio of total elements of intersection and union of two sets?
a) Rope Tree
b) Jaccard Coefficient Index
c) Tango Tree
d) MinHash Coefficient
Answer: Jaccard Coefficient Index
4. What is the value of the Jaccard index when the two sets are disjoint?
a) 1
b) 2
c) 3
d) 0
Answer: 0
5. When are the members of two sets more common relatively?
a) Jaccard Index is Closer to 1
b) Jaccard Index is Closer to 0
c) Jaccard Index is Closer to -1
d) Jaccard Index is Farther to 1
Answer: Jaccard Index is Closer to 1
6. What is the expected error for estimating the Jaccard index using MinHash scheme for k different hash functions?
a) O (log k!)
b) O (k!)
c) O (k2)
d) O (1/k½)
Answer: O (1/k½)
7. How many hashes will be needed for calculating Jaccard index with an expected error less than or equal to 0.05?
a) 100
b) 200
c) 300
d) 400
Answer: 400
8. What is the expected error by the estimator Chernoff bound on the samples performed without replacement?
a) O (log k!)
b) O (k!)
c) O (k2)
d) O (1/k½)
Answer: O (1/k½)
9. What is the time required for single variant hashing to maintain the minimum hash queue?
a) O (log n!)
b) O (n!)
c) O (n2)
d) O (n)
Answer: O (n)
10. How many bits are needed to specify the single permutation by min-wise independent family?
a) O (log n!)
b) O (n!)
c) Ω (n2)
d) Ω (n)
Answer: Ω (n)
Min Hash MCQs PDF Download
Categories: Hash Tables
Question and Answers 