Question

five values are interested in a hash table with size 20 Chaining is used to resolve the hash collision, if the metyused for insertion is uniform hashing,then what is the probability that no value is stored in the first 5 slots ?

a. (15*16*17*18*19)/(20*20*20*20*20)
b. (15*15*15*15*15)/(20*20*20*20*20)
c. (15*15*15*15*15)/(20*19*19*17*16)
d. (16*17*18*19*20)/(20*20*20*20*20)​

Answer 1

Answer:

Idk

Explanation:

Idk

Answer 2

Option (b)

• A hypothetical hashing mechanism known as simple Uniform hashing distributes objects equally throughout the slots in a hash table.

• In addition, regardless of the other elements currently in their respective slots, any object to be hashed has an equal chance of being placed there.

Probability that the first 5 slots are unfilled after the first 5 insertions =(probability that first item doesn't go in any of the first 5 slots)*

(probability that  item doesn't go in any of the first 5 slots)*

(probability that  item doesn't go in any of the first 5 slots)

= (15*15*15*15*15)/(20*20*20*20*20)

Hence the answer is option (b).

#SPJ2