In this project, you’ll exercise your understanding of how a hashtable functions to store key-value pairs. You’ll implement a hashtable with different probing methodologies to resolve collisions.
computer science
Description
Overview
In this project, you’ll exercise your understanding of how a hashtable functions to store key-value pairs. You’ll implement a hashtable with different probing methodologies to resolve collisions. You will use your hashtable implementation to count word frequencies in a text file, a common task in text analysis.
Learning Goals
• Implement a Hashtable interface using generic types for Keys and Values.
• Gain experience coding the main functions of an array-based hashtable.
• Gain experience coding several collision resolution schemes.
• Demonstrate an understanding of how a hashtable can be used to count word frequencies.
• Practice writing unit tests to ensure a program works correctly
General Information [Common]
Reminder: Copying partial or whole solutions, obtained from other students or elsewhere, is academic dishonesty.
Do not share your code with your classmates, and do not use your classmates’ code. If you are confused about what
constitutes academic dishonesty you should re-read the course policies. We assume you have read the course policies
in detail and by submitting this project you have provided your virtual signature in agreement with these policies.
