2 votes 2 votes Given the input sequence {11, 33, 43, 99, 34, 79, 19} and hash table of size 10 with the hash function h(k) = k mod 10. If hash table uses quadratic probing, the number of collisions occurred while mapping the given sequence is ______. Algorithms hashing algorithms + – Abhisek Saha asked Jun 19, 2017 Abhisek Saha 719 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 5 votes 5 votes 1) 11mod10=1 2) 33 mod 10=3 3)43mod10=3 , collision occurs therefore next place is obtained bu quadratic probing as (43+12)mod 10=4 4)99mod10=9 5)34mod10=4 so collision occurs , next place =(34+12)mod10=5 6)79mod10=9 collision next place= (79+12)mod10=0 7)19mod10=9 collision , next place =(19+12)mod10=0 collision , next place= (19+22)mod10=3 collision, next place = (19+32)mod10=8 therefore total 6 collisions are there Niraj Singh 2 answered Jun 19, 2017 selected Jun 19, 2017 by Abhisek Saha Niraj Singh 2 comment Share Follow See all 0 reply Please log in or register to add a comment.