Computer Science · Data Structures and Algorithms
हैशिंग के लिए टकराव समाधान रणनीतियों (collision resolution strategies) में, वह विधि जिसमें एक ही स्लॉट में हैश होने वाले सभी तत्वों को एक ही लिंक्ड लिस्ट में रखा जाता है, कहलाती है:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1चेनिंग✓
- 2क्वाड्रेटिक प्रोबिंग
- 3लीनियर प्रोबिंग
- 4यूनिवर्सल हैशिंग
सही उत्तर देखें
चेनिंग
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