資料結構›Ch8 雜湊第 22 題／共 37 題
22. Bloom Filter、False Positive、最佳雜湊函數個數
#DS-08-022易Bloom FilterFalse Positive最佳雜湊函數個數
題組題幹（本題：(b)，共 2 小題）點擊展開
Given the following bloom filter.
| [0] | [1] | [2] | [3] | [4] | [5] | [6] | [7] | [8] | [9] | [10] | [11] | [12] | [13] | [14] |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 0 |
[2%] Considering that the elements in the bloom filter is 5. To minimize the false positive probability, what is the ideal optimum number of hash functions?
📄 成大113
▤完整推導請見《WH 資工筆記 · 資料結構》Ch8 雜湊