1)

You will use a stack and a queue to implement a scrambled version of the rotational hashing function in Java. Before applying the rotational hash to the string, you will implement a function that will scramble the characters in the string so that every 3 successive characters in the string are inverted. For example, if the string to be hashed is "Jonathan", then the function should turn the string into "noJhtana" before applying the rotational hash. This function can be easily implemented using a stack and a queue.

2)

Now that you've implemented the hash tables you will use to implement a very simple registry for students' records. You will create a class to keep student's information: name, student ID, and grade. The program will have the following functionality:

The record is persistent, that is, the whole registry should be saved on file upon exiting the program, and after any major change.

The program should provide the option to create a new entry with a student's name, ID, and grade.

There should be an option to lookup a student from his student ID (this will be the key in the hash table).

There should be an option to remove a particular entry by providing the student ID.

There should be an option to display the whole registry, sorted by student ID.