*Data Structures and Algorithms Using Java* Chapter 5: Hashed Data Structures *

****************NO JOPTION PANE/NO POP-UP WINDOWS*NO DATABASES* -ONLY- JAVA ***************

The program should perform an UNLIMITED number of operations until the user enters a 6 to exit the program, Assume the identification numbers will be in the range 1000 to 50,000. Code an application program that keeps track of student information at your college: their names, identification numbers (the key field), and grade point averages in a fully encapsulated, Linear Quotient (LQ Hash) (PLEASE SHOW ME THAT IT IS LINEAR QUOTIENT HASH) . When launched, the user will be asked to input the maximum size of the data set, the initial number of students, and the initial data set. Once this is complete, the user will be presented with the following menu:

Enter: 1 to insert a new student's information,

2 to fetch and output a student's information,

3 to delete a student's information,

4 to update a student's information,

5 to output all the student information,

and 6 to exit the program