Question 11861 – Computer-Networks
May 7, 2024Question 17275 – NTA UGC NET JUNE 2023 Paper-1
May 7, 2024Question 8721 – Hashing
Consider a hash table with 100 slots. Collisions are resolved using chaining. Assuming simple uniform hashing, what is the probability that the first 3 slots are unfilled after the first 3 insertions?
Correct Answer: A
Question 9 Explanation:
Given Hash table consists of 100 slots.
They are picked with equal probability of Hash function since it is uniform hashing.
So to avoid the first 3 slots to be unfilled
= 97/100*97/100*97/100 =((97*97*97))⁄1003
They are picked with equal probability of Hash function since it is uniform hashing.
So to avoid the first 3 slots to be unfilled
= 97/100*97/100*97/100 =((97*97*97))⁄1003
(97×97×97)/1003
(99×98×97)/1003
(97×96×95)/1003
(97×96×95)/(3!×1003)
Subscribe
Login
0 Comments