Hashing function and bloom filter
Refer to this example http://billmill.org/bloomfilter-tutorial/ 1) Using the 2 of the 9 hash functions you have, duplicate the process found in the above example. 2) Next create a file with random inputs and use all 9 hashes this time http://pages.cs.wisc.edu/~cao/papers/summary-cache/node8.html 3) Choose several spots in the table with 9 hashes and confirm results with your program. False Positive -> (1-e^(-km/n))^k where n is the […]