Sign in
Please select an account to continue using cracku.in
↓ →
A has table with 10 buckets with one slot per bucket is depicted here. The symbols, S1 to S7 are initially entered using a hashing function with linear probing. The maximum number of comparisons needed in searching an item that is not present is
Create a FREE account and get: