“hashCode” method: The hash code is an integer value which is the characteristic of an object. The hashing algorithm is used to evaluate a hash code for an object. Different objects in the code contain same data and a hashing algorithm should give the same hash code for both. For example, if the user wants to evaluate the hash code for a string, he would use the characters making up the string in the calculation. Possibly the user would use each character’s Unicode value in a mathematical formula which would give us an integer value. “equals” method: The “equals” method finds whether the number object which invokes the method is equal to the object which is passed as an argument. This method will return “false” if the argument is null and the argument is an object of the different type with the different numeric value.

Question

Want to see the full answer?

Answer 1

Question

Chapter 19, Problem 14SA

Program Plan Intro

“hashCode” method:

The hash code is an integer value which is the characteristic of an object.

The hashing algorithm is used to evaluate a hash code for an object.

Different objects in the code contain same data and a hashing algorithm should give the same hash code for both.

For example, if the user wants to evaluate the hash code for a string, he would use the characters making up the string in the calculation. Possibly the user would use each character’s Unicode value in a mathematical formula which would give us an integer value.

“equals” method:

The “equals” method finds whether the number object which invokes the method is equal to the object which is passed as an argument.

This method will return “false” if the argument is null and the argument is an object of the different type with the different numeric value.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Java Objects and Linked Data: Select all of the following statements that are true. The Java Class Library's class ArrayList implements the LinkedList interface. In Java, when one reference variable is assigned to another reference variable, both references then refer to the same object. In Java, the "equals"-method that any object inherits can be overwritten to compare objects field by field.

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…

Hashing Create a method hashSetExe to use Java HashSet to store elements and print them. For example, input the elements: “Apple”, “Mango”, and “Grapes”. Please state what the output would be when printing the HashSet with the three elements. Create a method treeSetExe to use Java TreeSet to store elements and print them. For example, input the elements: “Apple”, “Mango”, and “Grapes”. Please state what the output would be when printing the TreeSet with the three elements. Create a hashing function that takes the string, calculate the sum of the ASCII code of each character, and return (sum%tableSize) as the index. For example, hash(“ab”, 11) returns 8, because ‘a’ is 97 and ‘b’ is 98, which adds up to 195, and 195%11 returns 8.