4 4 votes Consider a hash table of size $11$ that uses the hash function\[h(x)=(x+7)\bmod 11\]Keys are inserted in the order\[13,\,22,\,15,\,11,\,29,\,39,\,44\]The collision resolution technique used is linear probing.Which of the following table indices will remain empty after all insertions?$1$ $2$ $6$ $10$ Data Structures goclasses gate2026_cs_set1_memorybased data-structures hashing multiple-selects linear-probing one-mark + – 🚩 Low quality | 👮 Shankar_Kuchibhotla | 💬 “The answer is given as B whereas the correct one is A, C” GO Classes 861 views answer comment Share Follow Print See 1 comment 1 1 comment reply Complete_Analyzer commented Feb 15 reply Follow flag 1 Mark 0 0 replyShare Please log in or register to add a comment.
1 1 vote 1 and 6 Omkar_Patil 4 answered Mar 2 Omkar_Patil 4 comment Share Follow 0 reply Please log in or register to add a comment.
0 0 votes IndexValue0151Empty2393294Empty5Empty6Empty7228119131044 option A and C are correct Bhaskar_Pavan answered Apr 20 Bhaskar_Pavan comment Share Follow 0 reply Please log in or register to add a comment.