Computer Science · Hashing Data Structures
कौन सी ओपन एड्रेसिंग कोलिजन रेजोल्यूशन तकनीक में कोलिजन होने पर हैश टेबल में अगले उपलब्ध खाली स्लॉट की क्रमिक रूप से जांच की जाती है?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1डबल हैशिंग (Double hashing)
- 2सेपरेट चेनिंग (Separate chaining)
- 3द्विघात जांच (Quadratic probing)
- 4रैखिक जांच (Linear probing)✓
सही उत्तर देखें
रैखिक जांच (Linear probing)
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 Hashing Data Structures MCQs →Want more practice questions on Hashing Data Structures?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Hashing Data Structures