CHC5223 Data Structures and Algorithms 2023–2024 Semester 21 of 4Assignment 1Value 40% of CourseworkIndividual workLearning outcomesStudents will be able to understand:1.1 Data structures1.2 The applications of data structures1.3 Object-oriented programming concepts1.4 Methods for program testingStudents will have acquired skills in:2.1 Data abstraction2.2 The use of data structures2.3 Programming at a more advanced level in a high-level object-oriented language2.4 Program testing and documentationStudents will have acquired skills in:3.1 Self-management3.2 Learning3.3 Communication3.4 Problem solving3.5 Information technologySubmission requirementsThe assignment submitted should be compressed into a .zip file, the following files should becontained in the compressed file：• a report as a Microsoft Word document containing the code of all your classes.filename format: student ID+CHC5223_CW1_Report.docx• a .zip file containing the project: the runnable jar file (if available) and all the program’ssource code (.java).filename format: student ID+CHC5223_ CW1_Files.zipGeneral requirementsAll your programming must conform to “Java Conventions and Programming Guidelines” – seemodule Moodle site.You must paste the key source code of your implementation into your report, as text or asscreenshots.IntroductionThe topics of this assignment are array, linked list, and hash table. The objective of thisassignment is to develop a hash table data structure utilizing a double-linked list as theunderlying mechanism.RequirementsBasic rulesYou must create one executable project after completing all tasks.One Java class should be defined in one .java file respectively.CHC5223 Data Structures and Algorithms 2023–2024 Semester 22 of 4In the report, the source code of each task, together with the corresponding explanation, shouldbe presented separately.Failure to comply with these rules will result in zero marks.Task 1You must design and implement a doubly linked list without using any existing implementationin Java.➢ The double-linked list should be a generic data structure that can store elements of stringdata type.➢ You must create a Node class that represents each element in the doubled-linked list.➢ You must create a LinkedList class that represents a doubly linked list which should includemethods for inserting, deleting, accessing specific elements, checking empty, returning size,and other operations you want to implement.➢ The insertion operation should be done at the front of the list.➢ The implementation should include error handling to handle errors such as deletingelements from an empty list and accessing out-of-bounds. 5 marksYou must give clear rationales and detailed explanations of your design and implementation inthe report.5 marksTask 2You must design and implement a hash table based on a Java array (not any array list or existingimplementation from the Java library) and achieve the collision solution by using the linearprobing way.➢ You must create a LinearProbingHashTable class that represents a hash table by using thelinear probing way for collision resolution. The initial capacity of the array should notexceed 20.➢ You must devise a hash function that can work well for string-type data. The hash functiondevised should minimize the occurrence of collisions. You must not use the Java built-inhashCode method, though you can experiment with it.➢ The implementation can handle errors such as null keys or keys with unexpected formats.➢ The implementation should include methods for inserting, searching, deleting, andaccessing key-value pairs.➢ The implementation of the inserting operation can resize the table efficiently according tothe strategy you design if the hash table is too full.➢ The i代 写CHC5223、Java/c++ mplementation of the deleting operation can handle the situation when the key is notfound.➢ The implementation can keep track of the load factor of the hash table and display it aftereach insertion or deletion.➢ The implementation of the searching operation can search for the key and return thecorresponding value if the key is found.5 marksYou must give clear rationales and detailed explanations of your design and implementation inthe report.CHC5223 Data Structures and Algorithms 2023–2024 Semester 23 of 45 marksTask 3You must design and implement a hash table based on the linked list and achieve the collisionsolution by using the separate chaining way.➢ You must create a ChainingHashTable class that represents a hash table by using theseparate chaining way for collision resolution.➢ You must use the doubly linked list devised in task 1 to implement the separate chainingway. The capacity of the linked list of separate chaining should not exceed 8.➢ You must devise a hash function that can work well for string-type data. The hashingstrategy of the hash function should be designed differently from that of task 2 and shouldminimize the occurrence of collisions. You must not use the Java built-in hashCode method,though you can experiment with it.➢ The implementation can handle errors such as null keys or keys with unexpected formats.➢ The implementation should include methods for inserting, searching, deleting, andaccessing key-value pairs, as well as determining load factor.➢ The implementation of the inserting operation can resize the table efficiently if the hashtable is too full.➢ The implementation of the deleting operation can handle the situation when the key is notfound.➢ The implementation can keep track of the load factor of the hash table and display it aftereach insertion or deletion.➢ The implementation of the searching operation can search for the key and return thecorresponding value if the key is found.➢ The implementation of the hash table can resize the table capacity according to thestrategy you designed.5 marksYou must give clear rationales and detailed explanations of your design and implementation inthe report.5 marksTask 4You must implement a main program that engages objects of both the LinearProbingHashTableclass and the ChainingHashTable class.➢ You must design a set of test cases to evaluate the functionality and correctness of twodifferent hash tables.• Set the capacity of the hash table to a small value so that collisions are easy to occur.• Verify that each of the hash functions is working well.• Verify that each of the implemented methods is working correctly.• Verify that the implementations of the Linear Probing way and Separate Chaining wayfor collision solutions are working effectively.➢ The inner structure of the generated hash tables should be clearly illustrated as theexecuted result of the program.4 marksCHC5223 Data Structures and Algorithms 2023–2024 Semester 24 of 4You must give clear rationales and detailed explanations of your design and implementation inthe report.➢ Demonstrate the executed result of the program, including the generated hash table andcorresponding test data.➢ Contrast and analyze the two hash tables generated based on the same set of test casesgiven.➢ Contrast and analyze the difference between the two hash functions you devised based onthe same set of test cases given.➢ Give a rationale and detailed analysis of the effects of two different strategies of collisionsolution.6 markstotal 40 marksRelevant quotation“There are two ways of constructing a software design: One way is to make it so simple thatthere are obviously no deficiencies, and the other way is to make it so complicated that there areno obvious deficiencies. The WX：codehelp
