6. Which one of below is a good practice? and Why? 1. public static final HashMap hm = new HashMap(); 2. private static final HashMap hm = new HashMap(); public static String getElement(int key) { return hm.get(key); A: 1st, because it is this is static object and application can access it easliy B: 1st, as it has less lines of code C: 2nd, as it controls access to the map

6. Which one of below is a good practice? and Why? 1. public static final HashMap hm = new HashMap(); 2. private static final HashMap hm = new HashMap(); public static String getElement(int key) { return hm.get(key); A: 1st, because it is this is static object and application can access it easliy B: 1st, as it has less lines of code C: 2nd, as it controls access to the map

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

Below is the code for a Time class that has both an equals method and a hashCode method; however, the body of the hashCode method is missing. In the text box, write the code you would put inside the body of the hashCode method. Remember that a hashCode with no collisions is better than a hashCode that has collisions and a hashCode with no gaps in the values is better than a hashCode that has gaps. public class Time { private int hour; // A number between 1 and 12 private int min; // A number between 0 and 59 private boolean pm; // True if the time is pm. public Time(int hour, int min, boolean pm) { this.hour = hour; this .min = min; this.pm = pm; } public int getHour() { return hour; } public int getMin() { return min; } public boolean isPM() { return pm == true; } public boolean isAM() { return pm == false; } public boolean equals(Object clock) { if (this == clockj) return true; if…
. 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] Please provide comments to my code import java.util.HashMap;public class Items {private final HashMap<String, Integer> allWeapons = setHash("weapon");private final HashMap<String, Integer> allArmor = setHash("armor");private final HashMap<String, Integer> allConsumables = setHash("consumable");public String type;public String name;public int modifier;public Items(String type) {randomItem(type);}public Items(String type, String name) {switch (type) {case "weapon":if (allWeapons.containsKey(name)) {this.type = "weapon";this.name = name;this.modifier = allWeapons.get(name);} else {randomItem(type);}break;case "armor":if (allArmor.containsKey(name)) {this.type = "armor";this.name = name;this.modifier = allArmor.get(name);} else {randomItem(type);}break;case "consumable":if (allConsumables.containsKey(name)) {this.type = "consumable";this.name = name;this.modifier = allConsumables.get(name);} else {randomItem(type);}break;default:randomItem(type);break;}}private…
In this problem you are given a Set of data and an element. You will need to look to see if the set contains the element. If found return the element otherwise return "?". "Note sometimes the names of classes/variables/objects can be misleading!!!!" import java.util.HashSet;public class SetContainsLetter{public static Object solution(HashSet<Integer> nums, int elm){// ↓↓↓↓ your code goes here ↓↓↓↓return null;}}
11.8 At what point does the Java environment complain about your passinga non-Comparable value to an OrderedVector?11.9 Write the compareTo method for the String class.11.10 Write the compareTo method for a class that is to be ordered by a field,key, which is a double. Be careful: The result of compareTo must be an int.
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! //////////////////////
I'm having trouble to compile and run this Java code in visual studio code as there's only an error in the main function. import java.util.HashMap; import java.io.*; public class CardPointsList { static HashMap<String,Integer> Code = new HashMap<>(); static HashMap<Character,Integer> Order = new HashMap<>(); static String[][] hand= {{ "c5","s6","sK","dK","dA"},{"s7","s4","dJ","sA","h5"},{"sQ","d3","c9","hK","d5"}}; static int[] scores={0,0,0}; public static void sortHand() { String temp; for (int h=0;h<3;h++) {for (int i=0;i<5;i++) { for (int j=i+1;j<5;j++) { if (hand[h][j].charAt(0) < hand[h][i].charAt(0)) {temp = hand[h][j]; hand[h][j] = hand[h][i]; hand[h][i] = temp; } else if (hand[h][j].charAt(0) == hand[h][i].charAt(0)) { if (Order.get(hand[h][j].charAt(1)) < Order.get(hand[h][i].charAt(1))) {temp =…
Please read the instructions carefully and keep in mind of the bolded phrases. You are NOT ALLOWED to use HashSet Create a project in NetBeans and name the project Hw06. The class will contain the following static methods: reverseS – A method that displays a string reversely on the console using the following signature: public static void reverseS(String s) printSub1 – print all substrings of a string. The method signature: public static void printSub1(String s) /* Note for printSub1: duplicated substrings ARE ALLOWED, but loops are NOT ALLOWED */ printSub2 – print all substrings of a string. The method signature: public static void printSub2(String s) /* Note for printSub2: duplicated substrings are NOT ALLOWED, but loops ARE ALLOWED */ Note: All methods should be RECURSIVE. Any predefined classes that are based on Set are not allowed. In the main method, read a string from the user and output the reversed string and substrings to the screen: Sample Run: Please input a string:…
Q6) Answer the following: [2 Marks] a) Write a small code fragment that generates a random integer number using Random class . b) How do you check whether a given key is contained in a map? (Give a Java code example.) c) Create a class MapTester. In it, use a HashMap to implement a phone Book. In this class, implement two methods: public void enterNumber(String name, String number) public String lookupNumber(String name) The methods should use the put and get methods of the HashMap class to implement their functionality
Java Programming This week's project involves a text file with that holds all of the novel Don Quixote*, by Miguel Cervantes. The text file has been heavily processed. It contains only lowercase letters, spaces, and new lines. That is a good format for counting words. Write code that reads through the text file one word at a time using a Scanner, and the next() method. Put the words into a HashMap, where the words are used as keys, and the values are Integers used to keep track of how many times the words occur in the text. If the text was "one fish two fish red fish blue fish one two three" then the HashMap would look like this: key value "one".... 2 "fish"... 4 "two".... 2 "red".... 1 "blue"... 1 "three".. 1 Once you have created such a HashMap for the whole of the text you can write logic that prints out the answers to these questions: How many times does each of…
Write a class called Pokemon that has a name (e.g. “Pikachu”) and a number (e.g. 25). Implement a constructor that takes both values as parameters. Implement accessors for both values. Implement a toString() that returns a string in the format “Name(number)”, e.g. “Pikachu(25)”. Implement an equals(Object) method (two Pokémon are considered equal if they have the same number). Implement a hashCode() method that returns the number.(remember the equals and hashCode contract).
How to code using Netbeans: 1.)Public int getHoursWorked()- optional (created in main method). 2.) Public double getPayRate()- optional (created in main method). 3.) Public string getNames()- optional (created in main method).