Computer Science · Data Structures and Algorithms
A hash table has space for 200 records using simple uniform hashing. What is the approximate probability that at least one collision occurs before the table is 10% full (i.e., when inserting the 20th record)?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 10.10
- 20.20
- 30.62 to 0.95 (High probability due to Birthday Paradox)✓
- 40.00
Correct answer
0.62 to 0.95 (High probability due to Birthday Paradox)
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Data Structures and Algorithms MCQs →Want more practice questions on Data Structures and Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Data Structures and Algorithms