+1 vote
in Data Structures & Algorithms I by (88.2k points)
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^2)

(d) O (n)

The question is from Hash Tables topic in chapter Hash Tables of Data Structures & Algorithms I

I have been asked this question during an online exam.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
Right choice is (d) O (n)

The explanation is: The expected error for estimating the Jaccard index using MinHash scheme for k different hash functions is O (1/k½). The time required for single variant hashing to maintain the minimum hash queue is O (n).

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...