Question 69
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:
- Download Maths Shortcuts PDF
- Get 300+ previous papers with solutions PDF
- 500+ Online Tests for Free
Book Free CAT Mentorship
Get personalized CAT strategy from a 99%iler
500+ students mentored
OTP Verification
Enter the 6-digit code sent to your phone
Booking Summary
Session:Free CAT Mentorship
Phone:
Date:
Time:
Enter OTP
Didn't receive the OTP?
