← Quit0 / 0 correct
Data StructuresHard1 of 10

A Bloom filter with m bits and k hash functions holds n items. What happens to the false positive rate as n grows?