Question

Uppose we have n bits of memory available, and our set s has m members. Instead of using k hash functions, we could divide the n bits into k arrays, and hash once to each array. As a function of n, m, and k, what is the probability of a false positive? How does it compare with using k hash functions into a single array?

Answer 1

Explanation:

Suppose we have n bits of memory available, and our set S has m members. Instead ofusing k hash functions, we could divide the n bits into k arrays, and hash ... Each array has a single hash function.