Computer Science · Data Structures
Consider a hash table of size 7 implemented using an array A[0...6]. A modulo hash function h(k) = k MOD 7 is used to map the keys, and linear probing (open addressing) is used to handle collisions. If the keys 53, 32, 43, 51, 99 are inserted sequentially into an initially empty hash table, what will be the contents of array A?
- 1EMPTY, 43, 51, 99, 53, 32, EMPTY
- 2EMPTY, 99, 43, 51, 32, 53, EMPTY
- 3EMPTY, 43, 99, 51, 32, 53, EMPTY
- 4EMPTY, 43, 51, 99, 32, 53, EMPTY✓
Correct answer
EMPTY, 43, 51, 99, 32, 53, EMPTY
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!
Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
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