I'm trying to create a hash table and use the multiplicative method as a collision resolution. Our convention for the conversion of string data to numeric key is: a=01, b=02, c=03... So if the input to the table is "easy", the corresponding numeric key is 05011925 or 5011925. I've done research on the multiplicative method for collision resolution, but all sources present the process with the assumption that the numeric key is expressed in binary digits. The problem is we haven't covered bitwise operations. The help I need from you is in "translating" the following statements (which explains multiplicative method with binary numeric keys) into statements which explains the process on non-binary keys i.e. without the bitwise operations which we haven't covered yet.
The process is as follows:
1. Set all bits to the left of the imaginary radix point (of the binary key) to zero.
2. Shift left p bits (where p is log to base 2 of the size of the table) e.g. shift left 5 bits if the size of the table is 32.
3. Set the rightmost of the p bits to 1 (to make sure that h(k) is odd).
