1 Overview
This assignment will give you practice in developing a class for sorting and searching, with a specific application in mind. The class methods can mostly be implemented by adapting algorithms which you have seen. A template program is provided to you, and electronic submissions are required from you, as described below. Some but not all of your work will be auto-tested. All your work will be looked over by a tutor. Your mark for the assignment will be given on the basis of both the auto-testing (done by machine) and the quality of your program (as determined by visual inspection). Submit two files (StudentList.java and StudentListDemo.java).
2 General background and motivation
Lecturers and other teachers often need to process relatively large text files containing student examination results. For each unit at Macquarie University, for example, a typical results file contains one line of data for each student enrolled in the unit.
The student data may consist of name, student ID and examination score, amongst other possible data members. Usually such files are maintained in alphabetical order with respect to name. This makes the task of searching the file for a specific student much easier. The lecturer may sometimes want to display the data in merit order, that is, in decreasing order with respect to examination score. Amongst the lecturers there is reluctance to use a spreadsheet application for this purpose since such applications provide little protection against accidental destruction of the data.
You were approached by a client in the Statistics Department to write software to assist with the processing of such files. Since some such files involved will be large
(e.g. STAT170), you are requested to give consideration to the efficiency of the algorithms you use. With your COMPUTER PROGRAMMING knowledge about sorting, searching and object oriented programming fresh in your mind you begin the task with enthusiasm.
You know that there are some…