Question

You have a Bloom filter with three hash functions and an array of 10 indices. You have inserted one distinct item into the Bloom filter so far. What is the probability that exactly 2 bits are set in the Bloom filter?



For the analysis, assume that all of the hash functions map keys to locations independently and uniformly at random​

Answer 1

Answer:

Yuouhfsgggggtjtieoirhykfiguhgtbtkrke