HASHMAP 1. Build a Java application that makes the following association for colors: 1 Red 2 Green з вlack 4 White 5 Blue 2. Change the program to count the number of key-value (size) mappings in a map. 3. Change the program to copy all the mappings from the exiting hashmap to a new hashmap. 4. Change the program to check if the firsthasmap has the key 4. 5. Change the program to create a set view of the mappings contained in a map. 6. Change the program to print the value of a key 3. 7. Change the program to create a set of the keys from the hashmap. 8. Change the program to remove the mapping of key 2 from the hashmap. 9. Change the program to change the value for key 5 to "YELLOW".

HASHMAP 1. Build a Java application that makes the following association for colors: 1 Red 2 Green з вlack 4 White 5 Blue 2. Change the program to count the number of key-value (size) mappings in a map. 3. Change the program to copy all the mappings from the exiting hashmap to a new hashmap. 4. Change the program to check if the firsthasmap has the key 4. 5. Change the program to create a set view of the mappings contained in a map. 6. Change the program to print the value of a key 3. 7. Change the program to create a set of the keys from the hashmap. 8. Change the program to remove the mapping of key 2 from the hashmap. 9. Change the program to change the value for key 5 to "YELLOW".

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

See similar textbooks

Similar questions

. Write a code using the following hints and apply HashMap<K, V> and its methods get and put for public class CourseInformation (i) Create a HashMap object called Course to add a key and its value. //Key is your course name and value is your course code. (ii) Use put method to map a course name with the course code. // add any FOUR COURSE NAMES WITH ITS COURSE CODE which are represented as a String (iii) Use get method to find the course code for any one of the course.
Java 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…
Exercise 2: Create a Book class; where: lo Each book contains the following information: book title, book Author name, barcode (as long integers) and book topic. 6 Implement an appropriate constructor(s) and all necessary get/set methods. Test Book class: lo Create different book objects (at least 5 books) and store them in a LinkedList sorted by book barcode value. Generate a unique random integer value for the barcode. O Iterate through the LinkedList and print out the books' details o Create a second LinkedList object containing a copy of the above LinkedList, but in reverse order
Write code to create three instances of a HashMap class. Give two the same, and the third different data. Compare the objects and state the result
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…
la) Declare and instantiate a HashMap object named hMap whose values are Integers and keys are Strings. 1b) Write a for-each loop to find the total of the values in this HashMap.
Exercise 2. Create a Book class where: Each book contains the following information: book title book Author name, barcode (as fong integers), and book topic. o Implement an appropriate constructor(s) and all necessary get/set methods. Test Book class: o Create diffcrent book objects (at least 5 hooks) and store them in a LinkedList sorted by book barcode value Generate a unique random integer value for the barcode. Iterate through the LinkedList and print out the books' details O Create a second LinkedList object containing a copy of the above LinkedList, but in reverse order.
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.
Which 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.
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 False
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.
package comp1110.exam; /** * COMP1110 Exam, Question 5 */ public class Q5StringHash { /** * Return a hash of the given string as an integer in the range 0 ... buckets - 1. * * @param value The string to be hashed * @param buckets The number of buckets into which the hash should be made (defining its range) * @return An integer hash of value in the range 0 ... buckets - 1. */ public static int hash(String value, int buckets) { // FIXME complete this method, without using Java's built-in hashCode() method return -1; } } ///////////// DO NOT USE ANY INBUILT HASHING FUNCTIONS IN JAVA! //////////////////////