A hash table with ten buckets with one slot per bucket is shown. Symbols S1 to S7 are 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. 5
- D. 3
Answer: B. 5
Explanation: To search for a non-existent item, we probe until we find an empty slot. The longest chain of occupied slots determines the maximum probes. In the given table (implied by S1..S7), the longest cluster dictates the worst case.