• retagged by
1 flag 861 views
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. $1$ 
     
  2. $2$ 
     
  3. $6$ 
     
  4. $10$
  • 🚩 Low quality | 👮 Shankar_Kuchibhotla | 💬 “The answer is given as B whereas the correct one is A, C”

2 Answers

Answer:
Position:
Show:

Related questions

1 1 vote
1 1 answer
545
545 views
GO Classes asked Feb 12
545 views
Consider a min heap containing $n$ elements represented as an array, where $n>100$ and $n$ is odd.Assuming $1$-based indexing, which of the following cannot be the index ...
4 4 votes
1 1 answer
1.1k
1.1k views
GO Classes asked Feb 12
1,122 views
The height of a binary tree is the number of edges in the longest path from the root to a leaf in the tree.What is the maximum possible height of a full binary tree with ...
2 2 votes
1 1 answer
757
757 views
GO Classes asked Feb 12
757 views
Let P be the set of all integers from $1$ to $15$. Consider any order of insertion of the elements of P into a binary search tree that creates a CBT. Which one of the fol...
4 4 votes
1 1 answer
864
864 views
GO Classes asked Feb 12
864 views
The following sequence corresponds to the preorder traversal of a BST : $$T: 50, 25, 13, 40, 30, 47, 75, 60, 70, 80, 77$$The position of the element $60$ in the postorder...