Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
11th Edition
ISBN: 9780134670942
Author: Y. Daniel Liang
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 27.3, Problem 27.3.9CP
Program Plan Intro
Hash Code:
- First, a hash function converts a search key to an integer value and then it compresses this hash code into an index in the hash table.
- The hash code is simply a 32-bit signed int number, where the object is managed by a hash table.
- Actually, hash code is not a unique number for an object. The two objects will return the same hash code if both the objects are equal.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Write a program in Java that performs the following tasks:
Create an ArrayList, HashMap and HashSet Objects.
Add 2 entries to each one of them using an appropriate method.
JAVA
Create a new class HashSetManipulation with a main method.
Create a new HashSet set and populate it with initial values "A", "B", and "C" using the add method.
Print the size of the set using set.size().
Use a for loop to print the values in the set.
Use the add method to add a new value "D" to the set and print the result of the set to show that the value has been added.
Use the remove method to remove value "A" from the set and print the result of the set to show that the value has been removed.
Use the contains method to check if the value "C" exists in the set and print the result.
Java Code: For Lexer.java
Make a HashMap of <String, TokenType> in your Lex class. Below is a list of the keywords that you need. Make token types and populate the hash map in your constructor (I would make a helper method that the constructor calls).
while, if, do, for, break, continue, else, return, BEGIN, END, print, printf, next, in, delete, getline, exit, nextfile, function
Modify “ProcessWord” so that it checks the hash map for known words and makes a token specific to the word with no value if the word is in the hash map, but WORD otherwise.
For example,
Input: for while hello do
Output: FOR WHILE WORD(hello) DO
Make a token type for string literals. In Lex, when you encounter a “, call a new method (I called it HandleStringLiteral() ) that reads up through the matching “ and creates a string literal token ( STRINGLITERAL(hello world) ). Be careful of two things: make sure that an empty string literal ( “” ) works and make sure to deal with escaped “ (String quote = “She…
Chapter 27 Solutions
Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
Ch. 27.2 - Prob. 27.2.1CPCh. 27.3 - Prob. 27.3.1CPCh. 27.3 - Prob. 27.3.2CPCh. 27.3 - Prob. 27.3.3CPCh. 27.3 - Prob. 27.3.4CPCh. 27.3 - Prob. 27.3.5CPCh. 27.3 - Prob. 27.3.6CPCh. 27.3 - If N is an integer power of the power of 2, is N /...Ch. 27.3 - Prob. 27.3.8CPCh. 27.3 - Prob. 27.3.9CP
Ch. 27.4 - Prob. 27.4.1CPCh. 27.4 - Prob. 27.4.2CPCh. 27.4 - Prob. 27.4.3CPCh. 27.4 - Prob. 27.4.4CPCh. 27.4 - Prob. 27.4.5CPCh. 27.4 - Prob. 27.4.6CPCh. 27.5 - Prob. 27.5.1CPCh. 27.6 - Prob. 27.6.1CPCh. 27.6 - Prob. 27.6.2CPCh. 27.6 - Prob. 27.6.3CPCh. 27.7 - Prob. 27.7.1CPCh. 27.7 - What are the integers resulted from 32 1, 32 2,...Ch. 27.7 - Prob. 27.7.3CPCh. 27.7 - Describe how the put(key, value) method is...Ch. 27.7 - Prob. 27.7.5CPCh. 27.7 - Show the output of the following code:...Ch. 27.7 - If x is a negative int value, will x (N 1) be...Ch. 27.8 - Prob. 27.8.1CPCh. 27.8 - Prob. 27.8.2CPCh. 27.8 - Can lines 100103 in Listing 27.4 be removed?Ch. 27.8 - Prob. 27.8.4CPCh. 27 - Prob. 27.1PECh. 27 - Prob. 27.2PECh. 27 - (Modify MyHashMap with duplicate keys) Modify...Ch. 27 - Prob. 27.6PECh. 27 - Prob. 27.7PECh. 27 - Prob. 27.8PECh. 27 - Prob. 27.10PECh. 27 - Prob. 27.11PECh. 27 - (setToList) Write the following method that...Ch. 27 - (The Date class) Design a class named Date that...Ch. 27 - (The Point class) Design a class named Point that...
Knowledge Booster
Similar questions
- I've got a class called Foo. Instances of the Foo class store four integer instance variables named w, x, y, and z. What would be a good approach for generating hashes for the Foo class?arrow_forwardCreate a new Hash class that uses an arraylist instead of an array for the hash table. Test your implementation by rewriting (yet again) the computer terms glossary application.arrow_forwardWrite Junit test class that : Returns a hash code for this object instance. The approach described by Joshua Bloch in "Effective Java" . public int hashCode() Overrides:hashCode in class java.lang.Object Returns:A hash code.arrow_forward
- Is the following declaration of a HashMap valid: HashMap nums = new HashMap(); True False An enumeration can contain public constant variables True False An interface can extend as many interfaces as the programmer wants O True O Falsearrow_forwardWhat are the differences between the '==', 'equals()', and 'hashCode()' methods in Java when comparing objects?arrow_forwardWhich of the following statements are true about a HashSet ? Select all that apply. Hint: you should be able to answer this question based only on the material presented in class. If E inherits Object.hashCode(), then there will be no collisions. A HashSet iterator should iterate through the Hashset elements in the order in which they were added to the Hashset. Two HashSets are equal (according to the equals() method) if they have the same size and their elements can be paired such that the pairs are equal according to the E.equals() method. OA HashSet could be implemented using a HashMap namely the key is the same as the value.arrow_forward
- Is the following declaration of a HashMap valid: HashMap nun new HashMap(); True Falsearrow_forwardJava Code: 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, you should NOT fill in the value string, the type is enough. For tokens with no exact type we still need to fill in the token’s string. Rename “WORD” to “IDENTIFIER”. Strings and characters will require some additions to your state machine. Create “STRINGLITERAL” and “CHARACTERLITERAL” token types. These cannot cross line boundaries. Your lexer should throw an exception if it encounters a character that it doesn’t expect outside of a comment, string literal or character literal. Create a new exception type that includes a good error message and the token that failed. Ensure that the ToString method prints nicely. Add “line number” to your Token class. Keep track of the current line number in your lexer and populate each…arrow_forwardWhat is the difference in the result of returning the words in a HashSet compared with returning them in an ArrayList?arrow_forward
- Write a code in python, You will implement Hashtable using two techniques: Separate Chaining and Linear Probing. Implement Hashtable using Separate Chaining Implement hashtable using Linear Probing Test your both Hashtable classes with instances of Student class; you can have three (3) data members and appropriate functions, including hash() function. Test your both Hashtable classes with instances of Employee class; you can have three (3) data members and appropriate functions, including hash() function.arrow_forwardIn JAVA, use a HashMap to count and store the frequency counts for all the words from a large text document. Then, display the contents of this HashMap with given words and their frequency in the document. Next, please create a set view of the Map and store the contents in an array. Sort this array based on key value and display it. Finally, sort the array in decreasing order by frequency and display it.arrow_forwardjava,please solve it fast One of the following is a valid for-loop syntax to iterate through the elements of a HashMap: Select one: a. for(HashMap.Entry<Integer,String> wordsPart1.entrySet()) { System.out.println("Key: "+ entry.getKey() + "\tValue: "+entry.getValue()); } b. for(HashMap.Entry<Integer,String> entry:wordsPart1.entrySet()) { System.out.println("Key: "+ entry.getKey() + "\tValue: "+entry.getValue()); } c. for(HashMap<Integer,String> entry:wordsPart1.entrySet()) { System.out.println("Key: "+ entry.getKey() + "\tValue: "+entry.getValue()); } d. None of thesearrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
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