📚 Question Bank Q40 — Programming and Data Structure
Tags
Programming and Data Structure
Q40. Marks: +2.0 UGC NET Paper 2: Computer Science 8th Oct 2022
Consider the hash table of size 11 that uses open addressing with linear probing. Let h(k) = k mod 11 be the hash function. A sequence of records with keys 43, 36, 92, 87, 11, 47, 11, 13, 14 is inserted into an initially empty hash table, the bins of which are indexed from 0 to 10. What is the index of the bin into which the last record is inserted?
1.8
2.7 ✓ Correct
3.10
4.4
📄 All “Programming and Data Structure” questions across papers
🏷 Change Tag for this Question