Question

12. The following numbers are to be inserted into a hash table in the order shown: 47 61 91 21 34. The hash function is (Key % TableSize). Linear probing with rehash function ((HashValue + 1) % TableSize) is used to resolve collisions. \begin{tabular}{|c|c|} \hline [1] & [6] \\ \hline [2] & [ ] \\ \hline [3] & [ ] \\ \hline [4] & [ ] \\ \hline [5] & [ ] \\ \hline \end{tabular} Where will 61 be stored? A) [3] \\ B) [4] \\ C) [5] \\ D) [6] \\ E) There is not enough information to determine the answer.

          12. The following numbers are to be inserted into a hash table in the order shown: 47 61 91
21 34.
The hash function is (Key % TableSize). Linear probing with rehash function
((HashValue + 1) % TableSize) is used to resolve collisions.
\begin{tabular}{|c|c|}
\hline
[1] & [6] \\
\hline
[2] & [ ] \\
\hline
[3] & [ ] \\
\hline
[4] & [ ] \\
\hline
[5] & [ ] \\
\hline
\end{tabular}
Where will 61 be stored?
A) [3] \\
B) [4] \\
C) [5] \\
D) [6] \\
E) There is not enough information to determine the answer.

12. The following numbers are to be inserted into a hash table in the order shown: 47 61 91
21 34.
The hash function is (Key % TableSize). Linear probing with rehash function
((HashValue + 1) % TableSize) is used to resolve collisions.

[1] [6]

[2] [ ]

[3] [ ]

[4] [ ]

[5] [ ]

Where will 61 be stored?
A) [3]

B) [4]

C) [5]

D) [6]

E) There is not enough information to determine the answer.

Added by Catherine C.

Question

Please give Ace some feedback