MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 8 Mcqs, each offering curated multiple-choice questions to sharpen your Min Hash Multiple Choice knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Did Google conduct a large evaluation for comparing the performance by two technique MinHash and SimHash. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 2. |
Is MinHash used as a tool for association rule learning. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 3. |
How many bits are needed to specify the single permutation by min-wise independent family? |
| A. | O (log n!) |
| B. | O (n!) |
| C. | (n<sup>2</sup>) |
| D. | (n) |
| Answer» E. | |
| 4. |
What is the time required for single variant hashing to maintain the minimum hash queue? |
| A. | O (log n!) |
| B. | O (n!) |
| C. | O (n<sup>2</sup>) |
| D. | O (n) |
| Answer» E. | |
| 5. |
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 (k<sup>2</sup>) |
| D. | O (1/k ) |
| Answer» E. | |
| 6. |
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» E. | |
| 7. |
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 (k<sup>2</sup>) |
| D. | O (1/k ) |
| Answer» E. | |
| 8. |
What is the value of the Jaccard index when the two sets are disjoint? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 0 |
| Answer» E. | |