As each record is read, create a sorted Linked list of the contributors using the Insertion sort method. You also need to maintain your table, with one modification. You need to add an object to the Hash Collision Object that is a pointer to the data in
the Linked list. In addition, you need to implement Contributor search functionality based on a Contributor Name. Your design should include the following: High Level Implementation Instructions: Sorted Linked list Sorted using Insertion sort Hash bucket of
size 5 with a collision solution using a linked list (no need to order) A Search Algorithm based on ID and Contributor Name. The Contributor Name Algorithm needs to be implemented using the Sequential Search Each contributor will have the following information:
Name: String; //the name of the contributor City: String; //the city in which the contributor lives Country: String; //the country in which the contributor lives Phone: String; //the phone number for the contributor Contribution: Double; //the amount of the
contribution given by the contributor to the zoo ID: Integer; //identifier key for future needs Contributor functions/methods: Input constructor: //to accept a string for the name and additional information for each contributor (this should call the Add constructor
to implement the sorted list) Print constructor: //to print out the contributor data Print All constructor: //to print the entire list of contributor names Add constructor: //to traverse the Linked list and find the proper location for adding the instance
Search constructor: //the Search algorithm to implement is Sequential Search Each hash bucket collision item will have the following information: ID: Integer; //identifier key for future needs Contributor Address: Pointer; //a pointer to the address of the
contributor instance in the sorted linked list Hash bucket functions/methods: Input constructor: //to accept a string for the name and additional information for each contributor (you will only need the ID portion of the input data) Hash Function constructor:
//Hint: You only have 5 Hash buckets so the function can be very a simple calculation Pop constructor Push constructor Print constructor: //to show the information of the contributor based on a given ID Deliverables: The design saved in a Key Assignment Draft
that does not include any actual code and will be submitted as the deliverable in the next discussion board. A fully documented program to load the data creating a sorted linked list. A test plan to show how the program runs and can be executed. A screenshot
showing that the program loaded the data, and after all data is loaded perform the following: Print All showing the sorted list. Contributor information for Georg Pipps Contributor information for ID 25
Write a Review
Leave a reply Cancel reply
Ask Your Question
We have verified professionals who are ready to answer your question.
Save Time and Money
We choose experts who can quickly answer your question and that suit your budget.
Get Your Answer
Your satisfaction is 100% guaranteed. You can keep on asking questions until you get the answer you need.