Computer Science · Algorithms
हैशिंग में, एक बड़े की-स्पेस (key space) को छोटे हैश टेबल में मैप करते समय सैद्धांतिक रूप से कोलिशन (collisions) से बचना असंभव है, इसका मुख्य कारण है:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1ओपन एड्रेसिंग सिद्धांत (Open addressing principle)
- 2लोड फैक्टर लिमिट नियम (Load factor limit rule)
- 3पिजनहोल सिद्धांत (Pigeonhole principle)✓
- 4क्वाड्रैटिक प्रोबिंग बाधाएं (Quadratic probing constraints)
सही उत्तर देखें
पिजनहोल सिद्धांत (Pigeonhole principle)
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 Algorithms MCQs →Want more practice questions on Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Algorithms