0 votes 0 votes Consider a Hash table containing ‘n’ keys and ‘k’ slots. Each key will hash into a slot in the given Hash table. (Assume collisions are resolved by chaining). 1)What is the probability that the first slot of hash table will be empty? Algorithms hashing probability data-structures + – Rohan Mundhey asked Nov 9, 2016 retagged Jun 20, 2022 by makhdoom ghaya Rohan Mundhey 671 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Rohan Mundhey commented Nov 9, 2016 reply Follow Share Question got repeated..... 0 votes 0 votes Prabhanjan_1 commented Nov 9, 2016 reply Follow Share https://gateoverflow.in/76984/made-easy-2016-test-series 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes 1st one will be empty.So every key has to be placed in other k-1 slots.As insertion of every element is independent. so probability will be ((k-1)/k)^n Sayan Das 1 answered Nov 9, 2016 Sayan Das 1 comment Share Follow See all 0 reply Please log in or register to add a comment.