At this point, you decide to implement a Hash structure for the contributor data to prepare for searches. Please see attached contributor information from a file provided. As each record is read, create a Hash table for the ID field. The limitation for the Hash table is that it has a size of 5, so you need to be able to handle collisions. Collisions should be resolved through the use of a linked list for the ID values (implement this using a stack). Your design should include the following:
A Hash table pointing to a structure for a linked list that contains only the following information:
Each Hash Bucket Collision Item will have the following Information:
- ID: Integer; //identifier key for future needs
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 a very simple calculation.)
- Pop constructor
- Push constructor
- Print constructor: //to show the contents of a Hash bucket
Deliverables:
- A fully documented program to load the Hash table with collisions being handled as a linked list, implemented as a Stack
- 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, shows the contents of the first Hash bucket (ideally this is Bucket 0)
Looking for a solution written from scratch with No plagiarism and No AI?
WHY CHOOSE US?
We deliver quality original papers |
Our experts write quality original papers using academic databases.We dont use AI in our work. We refund your money if AI is detected |
Free revisions |
We offer our clients multiple free revisions just to ensure you get what you want. |
Discounted prices |
All our prices are discounted which makes it affordable to you. Use code FIRST15 to get your discount |
100% originality |
We deliver papers that are written from scratch to deliver 100% originality. Our papers are free from plagiarism and NO similarity.We have ZERO TOLERANCE TO USE OF AI |
On-time delivery |
We will deliver your paper on time even on short notice or short deadline, overnight essay or even an urgent essay |