InterviewSolution
Saved Bookmarks
| 1. |
A hash table with ten buckets with one slot per bucket is shown in the following figure. The symbols S1 to S7 initially entered using a hashing function with linear probing.The maximum number of comparisons needed in searching an item that is not present is(A) 4(B) 5(C) 6(D) 3 |
| Answer» None | |