Data Structures and Problem Solving using Java Question20.17
I am lost and need help figuring out how to do this.
How to implement a hashing table and function for strings. Wherethe table is twice the number of words in the dictionary. Everyword of the dictionary needs to be hashed into the table. And everytime a word is hashed into the table position a counter of thatposition should be incremented. Multiple words might hash to thesame location so the count will not always be the one because ofprobing. Then tabulate the counters and report the results comparedto a random distribution. Written in Java.
Answer
OR
OR