Advanced
Data Structures & Algorithms
Q94 / 100
What is the Bloom filter?
Correct! Well done.
Incorrect.
The correct answer is B) A space-efficient probabilistic structure for set membership that allows false positives but no false negatives
B
Correct Answer
A space-efficient probabilistic structure for set membership that allows false positives but no false negatives
Explanation
Bloom filters use k hash functions and a bit array. Membership check is O(k). False positives are possible; false negatives are not. Used in databases (Cassandra), browsers (malware detection).
Progress
94/100