1 votes 1 votes Algorithms algorithms hashing data-structures test-series + – rahul sharma 5 asked Dec 14, 2016 retagged Jul 14, 2022 by makhdoom ghaya rahul sharma 5 412 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 5 votes 5 votes Hash function is h(i)=(2i+1)mod11.After applying hashing No of free slots are=5. Total no of slots=11. Probability of not occuring collision=5/11. =0.45 santhoshdevulapally answered Dec 15, 2016 selected Dec 15, 2016 by Arjun santhoshdevulapally comment Share Follow See all 2 Comments See all 2 2 Comments reply rahul sharma 5 commented Dec 15, 2016 reply Follow Share I also solved the same way,but in solution they mentioned as 1/5. Sample space here would be all the slots or just the 5 vacant slots? 0 votes 0 votes santhoshdevulapally commented Dec 15, 2016 reply Follow Share It is wrong. how u know newly inserted element occupies one of the 5 slots. consider all slots in which how many slots are free. 2 votes 2 votes Please log in or register to add a comment.