Hash Data Structures Quiz

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?

A) (97 × 97 × 97)/100³

B) (99 × 98 × 97)/100³

C) (97 × 96 × 95)/100³

D) (97 × 96 × 95)/(3! × 100³)

Solution :

A) is correct.

Simple Uniform hashing function is a hypothetical hashing function that evenly distributes items into the slots of a hash table. Moreover, each item to be hashed has an equal probability of being placed into a slot, regardless of the other elements already placed.

Probability that the first 3 slots are unfilled after the first 3 insertions = (probability that first item doesn't go in any of the first 3 slots)*(probability that second item doesn't go in any of the first 3 slots)*(probability that third item doesn't go in any of the first 3 slots)
= (97/100) * (97/100) * (97/100)

Thanks for Reading

Placewit grows the best engineers by providing an interactive classroom experience and by helping them develop their skills and get placed in amazing companies.

Learn more at Placewit. Follow us on Instagram and Facebook for daily learning.

--

--

--

Upskilling students for tech placements!

Love podcasts or audiobooks? Learn on the go with our new app.

Recommended from Medium

Towards a frictionless tendering experience

All You Need to Know Before Automating

“The Migration To Ionic”…well…

Example: from MVP to MVVM using ViewModel and LiveData

Integrate User Login to Your WordPress Website with WSO2 Identity Server

12 Open Source Projects by Alibaba — Part 1

Dafabet888

Search In Rotated Sorted Array

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
Placewit

Placewit

Upskilling students for tech placements!

More from Medium

Scattered Rice Coding Question

A guide on coding interview preparation

Leetcode 525. Contiguous Array

Interview preparation -DSA #day1