“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

Computer Science : Using Java implement the following lab experiment using HashMap. Create a class Product with following details Instance Variable: pid(int), product_name(String), price (double) Overloaded Constructor toString() method Create another class called TestProductMap and implement the following in the main method: Create 10 products Create HashMap that accepts key integer and value product. Ex: HashMap<int, Product> Add all the product to the HashMap, every product key is 1, 2, 3 … so on Display the HashMap Add duplicate product to the map with different key Get the duplicate product that you just added to the list and display it. Delete a product from the HashMap. Display the HashMap

Java Code: Look through the Language Description and build a list of keywords. Add a HashMap to your Lexer class and initialize all the keywords. Change your lexer so that it checks each string before making the WORD token and creates a token of the appropriate type if the work is a key word. When the exact type of a token is known (like “WHILE”), you should NOT fill in the value string, the type is enough. For tokens with no exact type (like “hello”), we still need to fill in the token’s string. Finally, rename “WORD” to “IDENTIFIER”. Similarly, look through the Language Description for the list of punctuation. A hash map is not necessary or helpful for these – they need to be added to your state machine. Be particularly careful about the multi-character operators like := or >=. These require a little more complexity in your state machine. Strings and characters will require some additions to your state machine. Create “STRINGLITERAL” and “CHARACTERLITERAL” token types. These…

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.