Hash function- Right shifitng

Question

i have to implement this hash function

"h(k)=((A*k)*mod(2^32))rsh(32-r)".

Where rsh(32-r) is right shifting a number. How can i do this right shifting. I am confused as i don't know how many times it will right shift the number ? Also it is not mentioned in my PDF. And also table size=m=2^r. Therefore r=logm. **It is mandatory to use this hash function.

Result of (32-r) will be a constant if this constant will be pass to a right shift function then how will this function shift a constant ! My confusion is simply this @WhozCraig — rayan, Sep 06 '14 at 09:08

score 0 · Accepted Answer · answered Sep 06 '14 at 09:07

0

Here the equivalent function:

uint32_t rsh(uint32_t num, uint8_t pad) {
     return num >> pad;
}

h = rsh((A*k)*mod(2^32), 32 - r);

answered Sep 06 '14 at 09:07

GHugo

2,584
13
14

Hash function- Right shifitng

1 Answers1