Your boss loves Bloom filters. To impress her, you start implementing one. Your Bloom filter uses...

 

Transcribed Image Text:

Your boss loves Bloom filters. To impress her, you start implementing one. Your Bloom filter uses m=32 bits and 3 hash functions h1, h2, and h3, where hi(x) = (x²+x3)*i) mod m. In this case, answer the following question. (1 point) • Starting from an empty Bloom filter, you've inserted the following two elements: 2010, 2013. Note the bits in the Bloom filter have positions numbered 0 through 31. At the end of these insertions, which of the following bits IS NOT set to 1? 24 16 10 12 Your boss loves Bloom filters. To impress her, you start implementing one. Your Bloom filter uses m=32 bits and 3 hash functions h1, h2, and h3, where hi(x) = (x²+x3)*i) mod m. In this case, answer the following question. (1 point) • Starting from an empty Bloom filter, you've inserted the following two elements: 2010, 2013. Note the bits in the Bloom filter have positions numbered 0 through 31. At the end of these insertions, which of the following bits IS NOT set to 1? 24 16 10 12

Answer rating: 100% (QA)

For 2010 bits 12 24 and 4 ha... View the full answer