Question: Please in JAVA, It has to use hashing. Write a program to find values of a and M, with M as small as possible, such

Please in JAVA, It has to use hashing.

Write a program to find values of a and M, with M as small as possible, such that

the hash function (a * k) % M for transforming the kth letter of the alphabet into a

table index produces distinct values (no collisions) for the keys S E A R C H X M P L.

The result is known as a perfect hash function.

Thanks in advance

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!