Chapter Assessment

Check your understanding of Bloom filters: how a bit array and several hash functions answer set membership, why false negatives are impossible and false positives are not, what the variants change, and where a filter belongs in a real read path. There are 30 questions in the bank and you will be asked 14 of them, chosen to match how you are doing. Take it after you have worked through the chapter and the flashcards.

.....

Like the course? Get enrolled and start learning!