Sign in
Please select an account to continue using cracku.in
↓ →
A Hash Function f is defined as f(key) = key mod 7. With linear probing, while inserting the keys 37, 38, 72, 48, 98, 11, 56 into a table indexed from 0, in which location the key 11 will be stored (count table Index 0 as $$0^{th}$$ location )?
Create a FREE account and get:
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
Enter OTP
Didn't receive the OTP?
Start your IIM journey with the right preparation and crack CAT 2026.
Educational materials for CAT preparation