retagged by
486 views

2 Answers

Best answer
3 votes
3 votes

1 4 9 16 25 36 49 64 81 100 ...
So, no square will end in 3, 7 or 8. So, 3 buckets will always be empty for i2 mod 10

1 8 27 64 125 216 343 512 729 1000 ...

So, i3 mod 10 maps to all 10 slots.. 

Hence, B. 

selected by

Related questions

0 votes
0 votes
1 answer
2
tishhaagrawal asked Dec 16, 2023
354 views
Below is my approach to solving this question, can anyone please explain if I am doing it the right way?Let X = #free slotssince, m =7 and n = 3So, $4 \leqslant x\leqsla...
0 votes
0 votes
0 answers
3
Doraemon asked Mar 29, 2019
336 views
For multiplication method in hashing the formula is h(k)=m* (KA mod 1);m=2^p, k=key , 0<A<1My question is how does it actually works.Please explain in a detailed way.