A hash table with 10 buckets with one slot per bucket is depicted here. The symbols, A to G are initially entered using a hashing function with linear probing. The maximum number of comparisons needed searching an item that is not present is
|
0 |
B |
|
1 |
C |
|
2 |
|
|
3 |
F |
|
4 |
|
|
5 |
A |
|
6 |
|
|
7 |
G |
|
8 |
D |
|
9 |
E |
Enter numerical value using the virtual keypad. Round off where necessary.