1. Goals and Overview The goal of this assignment is to practice creating a hash table. This assignment also has an alternative, described in Section 5. A hash table stores values into a table (meaning an array) at a position determined by a hash function. 2. Hash Function and Values Every Java object has a method int hashCode() which returns an int suitable for use in a hash table. Most classes use the hashCode method they inherit from object, but classes such as string define their own hashCode method, overriding the one in object. For this assignments, your hash table stores values of type public class HashKeyValue ( K key; V value; } 3. Hash Table using Chained Hashing Create a hash table class (called HashTable211.java) satisfying the following interface: public interface HashInterface ( void add (K key, V value); // always succeeds as long as there is enough memory v find (K key); // returns null if there is no such key D Internally, your hash table is defined as a private java.util.LinkedList>[] table; The constructor for your hash table class must take an integer parameter which defines the size of the array table. When adding a value with a key that is already in the hash table, your add method must print both the value that it is replacing and the value that replaces it, and also increment a counter recording the number of key collisions.
1. Goals and Overview The goal of this assignment is to practice creating a hash table. This assignment also has an alternative, described in Section 5. A hash table stores values into a table (meaning an array) at a position determined by a hash function. 2. Hash Function and Values Every Java object has a method int hashCode() which returns an int suitable for use in a hash table. Most classes use the hashCode method they inherit from object, but classes such as string define their own hashCode method, overriding the one in object. For this assignments, your hash table stores values of type public class HashKeyValue ( K key; V value; } 3. Hash Table using Chained Hashing Create a hash table class (called HashTable211.java) satisfying the following interface: public interface HashInterface ( void add (K key, V value); // always succeeds as long as there is enough memory v find (K key); // returns null if there is no such key D Internally, your hash table is defined as a private java.util.LinkedList>[] table; The constructor for your hash table class must take an integer parameter which defines the size of the array table. When adding a value with a key that is already in the hash table, your add method must print both the value that it is replacing and the value that replaces it, and also increment a counter recording the number of key collisions.
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
![1. Goals and Overview
The goal of this assignment is to practice creating a hash table. This assignment also has an alternative, described in Section 5.
A hash table stores values into a table (meaning an array) at a position determined by a hash function.
2. Hash Function and Values
Every Java object has a method int hashCode() which returns an int suitable for use in a hash table. Most classes use the hashCode method they inherit from object, but classes such as string define their own hashCode method, overriding the
one in object.
For this assignments, your hash table stores values of type
public class HashKeyValue {
K key;
V value;
}
3. Hash Table using Chained Hashing
Create a hash table class (called HashTable211.java) satisfying the following interface:
public interface HashInterface {
void add(K key, V value); // always succeeds as long as there is enough memory
V find (K key);
// returns null if there is no such key
}
Internally, your hash table is defined as a
private java.util.LinkedList>[] table;
The constructor for your hash table class must take an integer parameter which defines the size of the array table.
When adding a value with a key that is already in the hash table, your add method must print both the value that it is replacing and the value that replaces it, and also increment a counter recording the number of key collisions.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fd08e19be-7e5e-4944-9492-2c1f0e254c97%2Ff94dfdf7-1592-4b09-b067-0570528e07be%2Frog71kn_processed.png&w=3840&q=75)
Transcribed Image Text:1. Goals and Overview
The goal of this assignment is to practice creating a hash table. This assignment also has an alternative, described in Section 5.
A hash table stores values into a table (meaning an array) at a position determined by a hash function.
2. Hash Function and Values
Every Java object has a method int hashCode() which returns an int suitable for use in a hash table. Most classes use the hashCode method they inherit from object, but classes such as string define their own hashCode method, overriding the
one in object.
For this assignments, your hash table stores values of type
public class HashKeyValue {
K key;
V value;
}
3. Hash Table using Chained Hashing
Create a hash table class (called HashTable211.java) satisfying the following interface:
public interface HashInterface {
void add(K key, V value); // always succeeds as long as there is enough memory
V find (K key);
// returns null if there is no such key
}
Internally, your hash table is defined as a
private java.util.LinkedList>[] table;
The constructor for your hash table class must take an integer parameter which defines the size of the array table.
When adding a value with a key that is already in the hash table, your add method must print both the value that it is replacing and the value that replaces it, and also increment a counter recording the number of key collisions.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 4 steps with 1 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education