Bloom filters are a space-efficient data structure used to test whether an element is part of a set. It can return false positives, but not false negatives, and elements can be added but not removed. They are useful when the amount of source data would require too much memory for conventional error-free hashing techniques.
Stanford University
Spring 2022
CS 168 provides a comprehensive introduction to modern algorithm concepts, covering hashing, dimension reduction, programming, gradient descent, and regression. It emphasizes both theoretical understanding and practical application, with each topic complemented by a mini-project. It's suitable for those who have taken CS107 and CS161.
No concepts data
+ 57 more concepts