Homework Help is Here – Start Your Trial Now!
Engineering
Data Structures and Algorithms
● Develop a simple hashtable with specified size (parameter) that accepts key-value pairs and stores them in an internal structure. The key has to be a string • Use your hash function from exercise 2 • The value can be an object • Demonstrate how your hashtable works with multiple inputs Implement add (key, value), get(key), and print () methods

● Develop a simple hashtable with specified size (parameter) that accepts key-value pairs and stores them in an internal structure. The key has to be a string • Use your hash function from exercise 2 • The value can be an object • Demonstrate how your hashtable works with multiple inputs Implement add (key, value), get(key), and print () methods

Question
Exercise 3 - Simple hash table Develop a simple hashtable with specified size (parameter) that accepts key-value pairs and stores them in an internal structure. ● • The key has to be a string ● ● Use your hash function from exercise 2 • The value can be an object Demonstrate how your hashtable works with multiple inputs Implement add (key, value), get(key), and print () methods
Transcribed Image Text:Exercise 3 - Simple hash table Develop a simple hashtable with specified size (parameter) that accepts key-value pairs and stores them in an internal structure. ● • The key has to be a string ● ● Use your hash function from exercise 2 • The value can be an object Demonstrate how your hashtable works with multiple inputs Implement add (key, value), get(key), and print () methods
Expert Solution
steps

Step by step

Solved in 3 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer