Java: An Introduction to Problem Solving and Programming (8th Edition)
8th Edition
ISBN: 9780134462035
Author: Walter Savitch
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Videos
Textbook Question
Chapter 12, Problem 5P
Write a
5
12
3
5
5
3
21
−1
then the program should output the following (not necessarily in this order):
The number 5 occurs 2 times.
The number 5 occurs 3 times.
The number 12 occurs 1 times.
The number 21 occcrs 1 times.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these 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.
How do I write a java program to count the number of times each finger presses one of the keys using hashSet?
When playing music on an Eb Alto Saxophone, the fingers press some keys more than others. For simplicity assume that the music is composed of only 1414 different notes. They are: C D E F G A B in one octave and C D E F G A B in a higher octave. We use c,d,e,f,g,a,b,C,D,E,F,G,A,B to represent them. The fingers typically used for each note are:
c: finger 22-44, 77-1010
d: finger 22-44, 77-99
e: finger 22-44, 77, 88
f: finger 22-44, 77
g: finger 22-44
a: finger 22, 33
b: finger 22
C: finger 33
D: finger 11-44, 77-99
E: finger 11-44, 77, 88
F: finger 11-44, 77
G: finger 11-44
A: finger 11-33
B: finger 11-22
(Note that every finger is controlling a specific key, different fingers are controlling different keys.)
A finger presses a key if it is needed in a note, and if that same finger is not used in the note previously played. Naturally, every key…
How do I write this java program in hashmap?
The program should create charts showing the consistency of the two judges. The rows represent the scores given by Dr. Stansifer and the columns represent the scores given by Dr. Shoaff. Suppose the maximum score is 3 the judges give the following scores.
Manatee ID
Dr. Shoaff's Score
Dr. Stansifier's Score
1
0
0
23
0
3
14
0
0
5
3
0
19
2
3
18
1
1
12
3
2
204
1
1
6
0
0
25
3
3
The consistency chart resulting from these scores are:
0
1
2
3
0
3
0
0
1
1
0
2
0
0
2
0
0
0
1
3
1
0
1
1
The "3" in the upper left hand corner indicates that there were 3 manatees that Dr Shoaff and Dr Stansifer gave a 0 score. (namely manatee 1, 14, 6). The 1 in row 0, column 1 indicates there was 1 manatee that Dr. Shoaff scored a 0 while Dr Stansifer scores a 3 (namely manatee 23). Ideally the only non-zero entries in the table would be along the diagonal indicating perfect consistency. Your program should take a group of scores…
Chapter 12 Solutions
Java: An Introduction to Problem Solving and Programming (8th Edition)
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.5 - What is the purpose of the FXML file?Ch. 12.5 - Prob. 32STQCh. 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
Additional Engineering Textbook Solutions
Find more solutions based on key concepts
In Exercises 61 through 66, rewrite the statements using augmented assignment operators. Assume that each varia...
Introduction to Programming Using Visual Basic (10th Edition)
What four items should you identify when defining what a program is to do?
Starting Out with Java: From Control Structures through Data Structures (4th Edition) (What's New in Computer Science)
Speeding Violation Calculator Design a program that calculates and displays the number of miles per hour over t...
Starting Out with Programming Logic and Design (5th Edition) (What's New in Computer Science)
What is the value of x after each of the following statements is executed? double x = Math.ceil(-Math.abs(-8 + ...
Java How to Program, Early Objects (11th Edition) (Deitel: How to Program)
This operator performs division, but instead of returning the quotient it returns the remainder. a. % b. c. d...
Starting Out with Python (3rd Edition)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- write a program in java which add 2 polynomial using hashmap<integer, double> with inputs from textfieldarrow_forwardI'm developing a card game that requires one deck of 52 cards using Java. Based on the code below, it outputs the total point chosen from the sorted suit out of the 5 cards that gives the highest point. I used hashmaps to program this code. Instead, I want the program to perform the same as before but using comparable/comparator instead of hashmaps. 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];…arrow_forwardusing mid square method, write a program that tells a user to input a string, then store it in an hashtable of size 100arrow_forward
- Write a Python program to print a hollow square pattern of stars (*) with a hash (#) symbol at the center of the square. The side length n of the square shall be entered by the user as an odd integer number greater than 4.arrow_forwardGiven 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 import java.util.Scanner;import java.util.HashMap; public class StudentGrades { public static void main (String[] args) { Scanner scnr = new Scanner(System.in); String studentName; double studentGrade; HashMap<String, Double> studentGrades = new HashMap<String, Double>(); // Students's grades (pre-entered) studentGrades.put("Harry Rawlins", 84.3); studentGrades.put("Stephanie Kong", 91.0); studentGrades.put("Shailen Tennyson", 78.6); studentGrades.put("Quincy Wraight", 65.4); studentGrades.put("Janine Antinori", 98.2); // TODO: Read in new grade for a…arrow_forwardIn JAVA, use a HashMap to count and store the frequency counts for all the words from a large text document. Using file util, please. Then, display the contents of this HashMap with words and frequency count. 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 as well. Please label your explanation in the code Thank youarrow_forward
- Stack CreateStack(S) push (S, 10) push (S, 15) push (S, 20) x = top (S) push (S, x + 5) x = pop (S) + top (S) push (S, x – pop (S)) push (S, pop (pop (S))) push (S, x – top (S)) push (S, push(S, x) – top (S)) After executing the given codes above, answer the questions and explain. Thanksarrow_forwardModify the given programs by adding two methods in HashTableClass: Show Full code with output Find and return the item with the maximum key; Find and return average of the keys in the hash table. import java.util.*;public class hashTableClass { public int tableSize; Node[] T; public hashTableClass() { System.out.println("Give the hash table size"); tableSize = Integer.parseInt(new Scanner(System.in).nextLine()); T = new Node[tableSize]; for (int i = 0; i < tableSize; i++) T[i] = null; } public int hashFunction(int Key) { return Key % tableSize; } public Node Search(int Key) { int h = hashFunction(Key); Node current = T[h]; while (current != null && current.item != Key) current = current.link; return current; } public void Insert(int newItem) { int h = hashFunction(newItem); Node current = T[h]; Node newNode = new Node(newItem);…arrow_forwardWrite a program that prompts the user to enter apositive integer and displays all its smallest factors in decreasing order. Forexample, if the integer is 120, the smallest factors are displayed as 5, 3, 2, 2,2. Use the StackOfIntegers class to store the factors (e.g., 2, 2, 2, 3, 5) andretrieve and display them in reverse order.arrow_forward
- Write a java program that enables the user to enter a string and an index,then cuts the letter in the given index(only cuts the single letter). Then prints the new string without that letterarrow_forwardModify the given programs by adding two methods in HashTableClass: Find and return the item with the maximum key; Find and return average of the keys in the hash table. import java.util.*;public class hashTableClass { public int tableSize; Node[] T; public hashTableClass() { System.out.println("Give the hash table size"); tableSize = Integer.parseInt(new Scanner(System.in).nextLine()); T = new Node[tableSize]; for (int i = 0; i < tableSize; i++) T[i] = null; } public int hashFunction(int Key) { return Key % tableSize; } public Node Search(int Key) { int h = hashFunction(Key); Node current = T[h]; while (current != null && current.item != Key) current = current.link; return current; } public void Insert(int newItem) { int h = hashFunction(newItem); Node current = T[h]; Node newNode = new Node(newItem); newNode.link = T[h];…arrow_forwardIn this task, two hash tables should should be implemented. You can follow the followinginstructions:- In class HashTable implement a hash table and consider the following:(i) Keys are integers (therefore also negative!) and should be stored in the tableint[] data.(ii) As a hash function take h(x) = (x · 701) mod 2000. The size of the table istherefore 2000. Be careful when computing the index of a negative key. Forexample, the index of the key x = −10 ish(−10) = (−7010) mod 2000 = (2000(−4) + 990) mod 2000 = 990.Hence, indices should be non-negative integers between 0 and 1999!(iii) Implement insert, which takes an integer and inserts it into a table. Themethod returns true, if the insertion is successful. If an element is already inthe table, the function insert should return false.(iv) Implement search, which takes an integer and finds it in the table. The methodreturns true, if the search is successful and false otherwise.(v) Implement delete, which takes an integer and deletes it…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 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
Definition of Array; Author: Neso Academy;https://www.youtube.com/watch?v=55l-aZ7_F24;License: Standard Youtube License