+1 vote
in Data Structures & Algorithms I by (88.2k points)
How many bits are needed to specify the single permutation by min-wise independent family?

(a) O (log n!)

(b) O (n!)

(c) Ω (n^2)

(d) Ω (n)

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

This question was addressed to me in final exam.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
The correct choice is (d) Ω (n)

Explanation: The time required for single variant hashing to maintain the minimum hash queue is O (n). Ω (n) bits are needed to specify the single permutation by min-wise independent family.

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

...