Java: Introduction to Problem Solving and Programming
7th Edition
ISBN: 9780133834604
Author: SAVITCH
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 12.2, Problem 15STQ
Program Plan Intro
“HashMap” class:
- This class implements the “Map” interface.
- This class stores a map from a key object to a value object.
- The class is named “HashMap” since the
algorithm used to implement the set is called a hash table. - The package for “HashMap” class is “import java.util.HashMap;”
Syntax for defining “HashMap” class:
HashMap<Key_Base_type, Value_Base_type> variable_name = new HashMap<Key_Base_type, Value_Base_type>();
From the above syntax, “Key_Base_type” and “Value_Base_type” represents “Integer”, “Double” or “String”.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Given a HashMap pre-filled with student names as keys and grades as values, complete main() by reading in the name of a student, outputting their original grade, and then reading in and outputting their new grade.
Ex: If the input is:
Quincy Wraight 73.1
the output is:
Quincy Wraight's original grade: 65.4 Quincy Wraight's new grade: 73.1
Write detailed java programming language code for hashmap. Take example of hashmap and give output screenshot with code.
All the values are stored in the same place, which is a major drawback of the hashmap we're using (that is, they are all in the same LinkedList). The hash map's intended purpose has been met.
Chapter 12 Solutions
Java: Introduction to Problem Solving and Programming
Ch. 12.1 - Suppose aList is an object of the class...Ch. 12.1 - Prob. 2STQCh. 12.1 - Prob. 3STQCh. 12.1 - Prob. 4STQCh. 12.1 - Can you use the method add to insert an element at...Ch. 12.1 - Prob. 6STQCh. 12.1 - Prob. 7STQCh. 12.1 - If you create a list using the statement...Ch. 12.1 - Prob. 9STQCh. 12.1 - Prob. 11STQ
Ch. 12.1 - Prob. 12STQCh. 12.2 - Prob. 13STQCh. 12.2 - Prob. 14STQCh. 12.2 - Prob. 15STQCh. 12.2 - Prob. 16STQCh. 12.3 - Prob. 17STQCh. 12.3 - Prob. 18STQCh. 12.3 - Prob. 19STQCh. 12.3 - Write a definition of a method isEmpty for the...Ch. 12.3 - Prob. 21STQCh. 12.3 - Prob. 22STQCh. 12.3 - Prob. 23STQCh. 12.3 - Prob. 24STQCh. 12.3 - Redefine the method getDataAtCurrent in...Ch. 12.3 - Repeat Question 25 for the method...Ch. 12.3 - Repeat Question 25 for the method...Ch. 12.3 - Repeat Question 25 for the method...Ch. 12.4 - Revise the definition of the class ListNode in...Ch. 12.4 - Prob. 30STQCh. 12 - Repeat Exercise 2 in Chapter 7, but use an...Ch. 12 - Prob. 2ECh. 12 - Prob. 3ECh. 12 - Repeat Exercises 6 and 7 in Chapter 7, but use an...Ch. 12 - Write a static method removeDuplicates...Ch. 12 - Write a static method...Ch. 12 - Write a program that will read sentences from a...Ch. 12 - Repeat Exercise 12 in Chapter 7, but use an...Ch. 12 - Write a program that will read a text file that...Ch. 12 - Revise the class StringLinkedList in Listing 12.5...Ch. 12 - Prob. 12ECh. 12 - Write some code that will use an iterator to...Ch. 12 - Prob. 14ECh. 12 - Write some code that will use an iterator to...Ch. 12 - Prob. 17ECh. 12 - Revise the method selectionSort within the class...Ch. 12 - Repeat the previous practice program, but instead...Ch. 12 - Repeat Practice Program 1, but instead write a...Ch. 12 - Write a program that allows the user to enter an...Ch. 12 - Write a program that uses a HashMap to compute a...Ch. 12 - Write a program that creates Pet objects from data...Ch. 12 - Repeat the previous programming project, but sort...Ch. 12 - Repeat the previous programming project, but read...Ch. 12 - Prob. 9PPCh. 12 - Prob. 10PPCh. 12 - Prob. 11PPCh. 12 - Prob. 12PPCh. 12 - Prob. 13PPCh. 12 - Prob. 14PPCh. 12 - Prob. 15PP
Knowledge Booster
Similar questions
- In 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_forwardImagine a HashMap H with integer as key and value type. We call H.insert(2, 3) and H.insert(2, 5). What does H.get(2) return?* 2 3 5 [3,5]arrow_forwardSince our hashmap was poorly constructed, all of the information is stored in a single container (a LinkedList). Why does this make hash maps less useful?arrow_forward
- What does the putIfAbsent method of HashMap do?arrow_forwardGive an example of Hashmaparrow_forwardCreate a graphical system that will allow a user to add and removeemployees where each employee has an employee id (a six-digitnumber), an employee name, and years of service. Use the hashcodemethod of the Integer class as your hashing function, and use oneof the Java Collections API implementations of hashing.arrow_forward
- What is the time complexity of the HashMap class's fundamental functions get() and put()?arrow_forwardAdd a constructor to SeparateChainingHashST that gives the client the abilityto specify the average number of probes to be tolerated for searches. Use array resizingto keep the average list size less than the specified value, and use the technique describedon page 478 to ensure that the modulus for hash() is primearrow_forwardHowever, the hashmap we're using is somewhat rudimentary, since it stores every value in one big bucket (that is, they are all in the same LinkedList). The hash map's intended function has been completed effectively.arrow_forward
- Create a new concreteclass that implements MyMap using open addressing with linear probing.For simplicity, use f(key) = key % size as the hash function, where size isthe hash-table size. Initially, the hash-table size is 6. The table size is doubledwhenever the load factor exceeds the threshold (0.5).arrow_forwardWrite a hash table in which both the keys and the values are of type String. (NOT generic programming OR a generic class.) Write an implementation of hash tables from scratch. Define the following methods: get(key), put(key,value), remove(key), containsKey(key), and size(). Remember that every object, obj, has a method obj.hashCode() that can be used for computing a hash code for the object, so at least you don't have to define your own hash function. **//Do not use any of Java's built-in generic types; create your own linked lists using nodes as covered in section 9.2.2 of Eck, D. J. (2019). Introduction to programming using Java, version 8.1. Hobart and William Smith Colleges. http://math.hws.edu/javanotes However, you do not have to worry about increasing the size of the table when it becomes too full.You should also write a short program to test your solution.arrow_forwardDoes anyone know a way that I can create a function in javascript that uses a hashmap to take values which are from a table, in my case itemID which is the name of the item and stockNum which is the total amount of that item, and then returns that specified ID when the stockNum goes lower than 10 for example. Any help would be appreciated.arrow_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 EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable 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