Easy
False positives and false negatives in a Bloom filter
A Bloom filter with k hash functions and an m-bit array supports insert and (probabilistic) membership query, but no deletion. Why can it produce false positives but is guaranteed to never produce a false negative?
14 of 46 in Data Structures & Algorithms