There are three parts to this question. Review the class below that adds elements to a hashtable. You may assume the class runs in a properly declared program with all necessary import statements. The key, value pairs are of type integer and string, respectively. Write program statements where indicated in the class declaration. // BEGIN simple class definition without size, load factor etc class AddElementsToHashtable { public static void main(String args[]) { // Q. 1 Write a statement to declare a new hashtable called hashy1 // Q.2 Write statements to insert values "one" "two" and "three" // Q.3 Write a statement to print the key, value pairs to the console }

There are three parts to this question. Review the class below that adds elements to a hashtable. You may assume the class runs in a properly declared program with all necessary import statements. The key, value pairs are of type integer and string, respectively. Write program statements where indicated in the class declaration. // BEGIN simple class definition without size, load factor etc class AddElementsToHashtable { public static void main(String args[]) { // Q. 1 Write a statement to declare a new hashtable called hashy1 // Q.2 Write statements to insert values "one" "two" and "three" // Q.3 Write a statement to print the key, value pairs to the console }

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

Define a class Car as follows:class Car { public String make; public String model; public int mpg;// Miles per gallon}a) Implement a comparator called CompareCarsByMakeThenModel that can be passed as an argument to the quicksort method from the lecture notes. CompareCarsByMakeThenModel should return a value that will cause quicksort to sort an array of cars in ascending order (from smallest to largest) by make and, when two cars have the same make, in ascending order by model.b) Implement a comparator called CompareCarsByDescendingMPG that can be passed as an argument to the quicksort method from the lecture notes. CompareCarsByDescendingMPG should return a value that will cause quicksort to sort an array of cars in descending order (from largest to smallest) by mpg.c) Implement a comparator called CompareCarsByMakeThenDescendingMPG that can be passed as an argument to the quicksort method from the lecture notes.…
Please implement in Java implement a keyed bag in which the items to be stored are strings (perhaps people’s names) and the keys are numbers (perhaps Social Security or other identification numbers). So, the in- sertion method has this specification: public void insert(String entry, int key);// Precondition: size( ) < CAPACITY, and the // bag does not yet contain any item// with the given key.// Postcondition: A new copy of entry has// been added to the bag, with the given key. When the programmer wants to remove or retrieve an item from a keyed bag, the key of the item must be specified rather than the item itself. The keyed bag should also have a boolean method that can be used to determine whether the bag has an item with a specified key. In a keyed bag, the pro- grammer using the class specifies a particular key when an item is inserted. Here’s an implementation idea: A keyed bag can have two private arrays, one that holds the string data and one that holds the corresponding…
Please identify two types of antipatterns (also called code smells) in the following source code:public abstract class AbstractCollection implements Collection {public void addAll (AbstractCollection c) {if (c instanceof Set) {Set s = (Set) c;for (int i=0; i < s.size () ; i ++) {if (!contains (s.getElementAt (i) )) {add (s.getElementAt(i) );}}} else if (c instanceof List) {List l = (List) c;for ( int i=0; i < l.size() ; i++) {if ( !contains l.get (i) )) {add (l.get(i) );}}} else if ( c instanceof Map) {Map m = (Map) c;for (int i=0; i<m.size () ; i++)add (m.key[i] , m.values [i] );}}}
do the changes in this program according to the given instruction import java.util.*;class CourseManager{//toatl students each section can holdstatic int max_Students;//mapping of each sections w.r.t to courseHashMap<String,ArrayList<Section> > courses ; //constructor for CourseManagerpublic CourseManager(int max){max_Students = max;courses = new HashMap<>();}//class Person which will be used by teacher and students to inherit its propertiesstatic class Person{String name;int age;public Person(String name , int age ){this.name = name;this.age = age;}}//teacher classstatic class Teacher extends Person{int id;public Teacher(int id , String name , int age ){super(name , age );this.id = id;}}//student classstatic class Student extends Person{int id;public Student(int id , String name , int age ){super(name , age );this.id = id;}}//section classstatic class Section{int section;String course ;Teacher instructor;int size ;HashMap<Integer ,Student >…
Analyze the time complexity of this program in big-O notation, assuming the size of L1 is n and the size of L2 is n too public static <AnyType extends Comparable<? super AnyType>>void intersection(List<AnyType> L1, List<AnyType> L2,List<AnyType> Intersect){ ListIterator<AnyType> iterL1 = L1.listIterator();ListIterator<AnyType> iterL2 = L2.listIterator(); AnyType itemL1=null, itemL2=null; // get first item in each listif ( iterL1.hasNext() && iterL2.hasNext() ){itemL1 = iterL1.next();itemL2 = iterL2.next();} while ( itemL1 != null && itemL2 != null ){int compareResult = itemL1.compareTo(itemL2); if ( compareResult == 0 ){Intersect.add(itemL1);itemL1 = iterL1.hasNext()?iterL1.next():null;itemL2 = iterL2.hasNext()?iterL2.next():null;}else if ( compareResult < 0 ){itemL1 = iterL1.hasNext()?iterL1.next():null;}else{itemL2 = iterL2.hasNext()?iterL2.next():null;}}
Write a Java class called ContainsInRange. This class defines a method called contains(), which takes as parameters an integer array a, an integer x, an int called start, as well as an int called end, and returns a boolean which is true if and only if x occurs in a at a position which is greater than or equal to start, and less than end. You must validate that start is less than or equal to end, and that both start and end are greater than or equal to 0, and less than or equal to a.length. Repeat the operation often.
This assignment is about OOP: Given Human class (Human.java) , please write a Student class (Student.java). This Student class is one child class of Human. A test file (CIS365Hw2InheritanceTest.java) of using the Student class is also given. Here is the result of running the CIS365Hw2InheritanceTest.java Student 1: no name, 0 years old, no major (10 points)Student 2: John, 18 years old, Computer Science (10 points)******** After change ******** (5 points)Student 1: Mary, 22 years old, Math (20 points)Student 1: Mary, 22 years old, Computer Science (20 points)Hello, I am a Student, and my name is Mary (20 points) public class CIS365Hw2InheritanceTest { public static void main(String[] args) { Student stu1=new Student(); Student stu2=new Student("John",18,"Computer Science"); System.out.println("Student 1:…
How to pass this test case? Please public void testDao(){ MessageDao.reset(); MessageDao messageDao = MessageDao.getInstance(); Assert.assertEquals(messageDao, MessageDao.getInstance()); // test that constructor is private List<Constructor> constructors = Arrays.asList(MessageDao.class.getConstructors()); Assert.assertEquals(constructors.size(), 0); constructors = Arrays.asList(MessageDao.class.getDeclaredConstructors()); Assert.assertEquals(constructors.size(), 1); Assert.assertTrue(Modifier.isPrivate(constructors.get(0).getModifiers())); } We are supposed to fill this out in order to pass this test: package dao; import dto.MessageDto; import java.util.ArrayList; import java.util.HashMap; import java.util.List; import java.util.Map; // TODO fill this out public class MessageDao implements BaseDao<MessageDto> { private static MessageDao instance = new MessageDao(); public static MessageDao getInstance() { } // TODO fill this out @Override public void put(MessageDto…
Here is my code in Java: import java.util.Scanner; import java.util.HashMap; public class Inventory { /** This class demonstrates the inventory */ //Declarations Of inventory static final int LightBulb60W = 1; static final int LightBulb100W = 2; static final int BoltM5 = 3; static final int BoltM8 = 4; static final int Hose25 = 5; static final int Hose50 = 6; public static void main (String [] args) { //Scanner Object @SuppressWarnings("resource") Scanner keyboard = new Scanner(System.in); //Variables int month; int day; int year; double units; double cost = 0; //Declarations int total; HashMap<Integer, String> productMap = new HashMap<>(); productMap.put(1,"Light Bulb 60W"); productMap.put(2,"Light Bulb 100W"); productMap.put(3,"Bolt M5"); productMap.put(4,"Bolt M8"); productMap.put(5,"Hose 25 feet"); productMap.put(6,"Hose 50 feet 60W"); while(true){ //Prints out inventory System.out.println("The Inventory: "); System.out.println("1…
use java (ArrayList, inheritance, polymorphism, File I/O and basic Java) Student class: First, you need to design, code in Java, test and document a base class, Student. The Student class will have the following information, and all of these should be defined as Private: A first name (given name) A last name (family name/surname) Student number (ID) – an integer number (of type long) The Student class will have at least the following constructors and methods: (i) two constructors - one without any parameters (the default constructor), and one with parameters to give initial values to all the instance variables of Student. (ii) only necessary set and get methods for a valid class design. (iii) a reportGrade method, which you have nothing to report here, you can just print to the screen a message “There is no grade here.”. This method will be overridden in the respective child classes. (iv) an equals method which compares two student objects and returns true if they…
Please help with coding this in Java In this part, you will implement a class edu.ucdenver.morse.Morse that will provide two instance methods: encode(String) and decode(String). Create the class Morse in the package edu.ucdenver.morse Add two private hash maps (instance variables) between strings, to map the encoding representation. One will map the actual character to the sequence of dots and dashes to represent that character. The other will do the reverse mapping. Initialize these maps in the constructor. Implement the instance methods to encode/decode as follows: Implement the encode(String) method, that given a clean string (normat text) will return the Morse Code encoded representation Example: Input String: "Hello World" Output String: "....=.=.-..=.-..=---= .--=---=.-.=.-..=-..=" Implement the decode(String) method, that given the encoded string (Morse Code) will return the clean text representation. Example: Input String: "....=.=.-..=.-..=---= .--=---=.-.=.-..=-..="…
1 IN JAVA ----- Write a method of public class called "isInputOneValid" that verifies if a string parameter called "inputOne" is included inside an array called "tableOne". Return as a boolean (if valid, return true, if not, false)