Computer Science · Data Structures
A hash table using chaining is resized whenever the load factor exceeds 2. If the table size is doubled during resizing while the total number of stored elements remains unchanged, what happens to the load factor immediately after resizing?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1It becomes O(log n)
- 2It doubles
- 3It halves✓
- 4It remains exactly the same
Correct answer
It halves
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 MCQs →Want more practice questions on Data Structures?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Data Structures