Question: Using eclipse java .4.4 Write a program to find values of a and M, with M as small as possible, such that the hash function
.4.4 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 Test case 3.4.4: Enter the Keys separated by spaces: SEARCHX M PL Output: a , M =
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
