Decide how you will convert the codewords into integers. One simple option is to use $$ord$()$ or something similar to convert each letter to an integer, then sum them.

However, this is likely to produce integers in a relatively small range. Another idea is to choose a constant integer c $>1,$ and compute an integer from a codeword using something The Director of SNEAKS was once a Computer Science professor and he has fortunately

taken an interest in your project. He has already decided that you are required to use

some form of open addressing.

He wants you to explore at least two forms of open addressing: quadratic probing and

double hashing. For each method he wants you to determine a table size that lets you

achieve the required performance standard. See below for a discussion of how to compute

the necessary information.

The Director has also set you an interesting challenge: if you can achieve the required

performance level with a table size no greater than $2500,$ he will double your consulting

fee. If your table size is greater than $3500,$ your fee will be reduced by $50\%.$

Part $1$:

Decide how you will convert the codewords into integers. One simple option is to use

"ord$()"$ or something similar to convert each letter to an integer, then sum them.

However, this is likely to produce integers in a relatively small range. Another idea is to

choose a constant integer $c>1,$ and compute an integer from a codeword using something

like this:

# $1$et s be the codeword, with letters s$1,$ s$2...$ sn

result $=s1$

for $i=2$dotsn :

resul $t=$ result $**c+si$

return resultlike this:

# let s be the codeword, with letters s$1,$ s$2...$ sn

result $=$ s$1$

for i $=2..$ n:

result $=$ result $*$ c $+$ si

return result