1 1 vote double hashing satisfies the uniform hashing assumption. TRUE/FALSE explain Data Structures + – Anil Khatri 1.5k views answer comment Share Follow Print See all 3 Comments 3 3 Comments reply Habibkhan commented Sep 28, 2016 reply Follow flag In my opinion , it should be true since double hashing is from primary clustering and almost free from secondary clustering so the 2 similar keys won't follow the same path for seeking slot in case of collision like linear and quadratic probing.Hence the distribution of the keys over the slots should be uniform. 0 0 replyShare Anil Khatri commented Sep 28, 2016 reply Follow flag ans given is False . explanation given: Double Hashing only provides n^2 permutation , not n! 0 0 replyShare set2018 commented Oct 5, 2017 reply Follow flag Habibkhan how primary clustering in double hashing? 0 0 replyShare Please log in or register to add a comment.
0 0 votes Double hashing should be uniform hashing. why because.... Double hashing neither suffers from primary clustering nor secondary clustering. but coming up with such hash functions is difficult since the functions should ideally cover all the slots uniformly without leading to collisions. please correct me if I am wrong. MIRIYALA JEEVAN KUMA answered Jan 16, 2018 MIRIYALA JEEVAN KUMA comment Share Follow 0 reply Please log in or register to add a comment.
