Question 10445 – Propositional-Logic
May 1, 2024
Question 3026 – Data-Interpretation
May 1, 2024
Question 10445 – Propositional-Logic
May 1, 2024
Question 3026 – Data-Interpretation
May 1, 2024

Question 10574 – Hashing

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

Correct Answer: B

Question 7 Explanation: 
In this, maximum size of cluster = 4 (S6, S3, S7, S1)
→ Worst case of finding a number is equal to maximum size of cluster + 1(after searching all the cluster it enters into empty cluster)
→ Maximum no. of comparisons = 4 + 1 = 5
A
4
B
5
C
6
D
3
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x
error: Alert: Content selection is disabled!!