BLOOM FILTER, GREEDY
ALGORITHMS, AND DYNAMIC
PROGRAMMING CONCEPTS| 2026
QUIZZES
Bloom Filter - Answer-A data structure that tests whether an element is a member of a
set.
Items needed for Bloom Filter - Answer-m size array and k hash functions.
Insertion in Bloom Filter - Answer-Perform k hashes with the item and assign bit array
indexes to 1.
Insertion runtime for Bloom Filter - Answer-O(k).
Search in Bloom Filter - Answer-Check if array value is 0 for each hash result.
Search runtime for Bloom Filter - Answer-O(k).
Probability of a False Positive - Answer-p(E) = (1 - (1-1/m)^nk)^k.
Space complexity of Bloom Filter - Answer-O(m).
Greedy Algorithms - Answer-Make the best decision at the moment, but does not
guarantee an optimal solution.
Change Making Problem - Answer-Given a coinage system, find how many coins to
give for a value n.
Fractional Knapsack Problem - Answer-A thief wants to maximize value while carrying
at most W pounds.
Interval Scheduling Problem - Answer-Determine a schedule such that there are no
overlapping executions of jobs.
Dynamic Programming - Answer-A technique applied to optimization problems when
subproblems overlap.
Steps to develop a Dynamic Programming solution - Answer-Characterize structure,
define value, compute value, construct solution.
