# 50+ Min Hash MCQs with FREE PDF

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

#### 2. Which indicator is used for similarity between two sets?

a) Rope Tree

b) Jaccard Coefficient

c) Tango Tree

d) MinHash 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

a) 1

b) 2

c) 3

d) 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

a) O (log k!)

b) O (k!)

c) O (k2)

d) O (1/k½)

a) 100

b) 200

c) 300

d) 400

a) O (log k!)

b) O (k!)

c) O (k2)

d) O (1/k½)

a) O (log n!)

b) O (n!)

c) O (n2)

d) O (n)

a) O (log n!)

b) O (n!)

c) Ω (n2)

d) Ω (n)