Few queries 1. what are the preffered way of implementing these hash functions? 2. why we have choose exactly 3 hash functions? Thanks for the video btw. Making shorts can help channel.
1) these can be similar to the one we used in count min sketch 2) that is just for explanation purpose, more the number of functions, less will be hash collision
We can't that is the point of probabilistic DS, we can only say with 100% guarantee if something is not present. Ideally we should have enough hash function so that collision is minimum
![Lp. Сердце Вселенной #60 РОЖДЕНИЕ ЛОЛОЛОШКИ [Финал] • Майнкрафт](http://i.ytimg.com/vi/YoR0pAV9FVQ/mqdefault.jpg)
Few queries
1. what are the preffered way of implementing these hash functions?
2. why we have choose exactly 3 hash functions?
Thanks for the video btw. Making shorts can help channel.
1) these can be similar to the one we used in count min sketch
2) that is just for explanation purpose, more the number of functions, less will be hash collision
In this example, how can we check whether Chennai is not on the list?
We can't that is the point of probabilistic DS, we can only say with 100% guarantee if something is not present. Ideally we should have enough hash function so that collision is minimum
@@TheTechGranth Got it. Thanks for the clarification.
@@venkatramanpothiraj9438 do like and subscribe and share with others 🙂