Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
11th Edition
ISBN: 9780134670942
Author: Y. Daniel Liang
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Expert Solution & Answer
Chapter 30.5, Problem 30.5.4CP
Explanation of Solution
Purpose of given code:
The purpose of given code is to print resultant elements in array variable “m” with “IntStream” class using aggregate functions. It prints all distinct values using “distinct()” method and prints all resultant values of array “m[][]” using “forEach()” method with a character “,”...
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Java Program ASAP
Please modify Map<String, String> morseCodeMap = readMorseCodeTable("morse.txt"); in the program so it reads the two text files and passes the test cases. Down below is a working code. Also dont add any import libraries in the program just modify the rest of the code so it passes the test cases.
import java.io.BufferedReader;import java.io.FileReader;import java.io.IOException;import java.util.HashMap;import java.util.Map;import java.util.Scanner;public class MorseCodeConverter { public static void main(String[] args) { Map<String, String> morseCodeMap = readMorseCodeTable("morse.txt"); Scanner scanner = new Scanner(System.in); System.out.print("Please enter the file name or type QUIT to exit:\n"); do { String fileName = scanner.nextLine().trim(); if (fileName.equalsIgnoreCase("QUIT")) { break; } try { String text =…
void doo(list &L){
int item,a,p=L.size()-1; L.retrieve(p,a);
for(int i=0;i
A student record system uses an ArrayList object called studrecs tomaintain a collection of student details where each student is anobject defined by the Student class. The student class has accessormethods getName() and getRegNo()
1. Write a for-each loop that iterates through the studrecs collectionwriting out each student’s name and registration number.
2. In general, how many times does a for-each loop iterate?
3. Write the code for a while loop to iterate through the studrecscollection writing out each student’s name and registration number.
4. Write the code for an Iterator to loop through the studrecs collectionwriting out each student’s name and registration number.
Chapter 30 Solutions
Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
Ch. 30.1 - Prob. 30.1.1CPCh. 30.2 - Prob. 30.2.1CPCh. 30.2 - Prob. 30.2.2CPCh. 30.2 - Prob. 30.2.3CPCh. 30.2 - Prob. 30.2.4CPCh. 30.3 - Prob. 30.3.1CPCh. 30.3 - Prob. 30.3.2CPCh. 30.3 - Prob. 30.3.3CPCh. 30.3 - Prob. 30.3.4CPCh. 30.3 - Given an array names in Listing 30.1, write the...
Ch. 30.4 - Prob. 30.4.1CPCh. 30.4 - How do you create a parallel stream?Ch. 30.4 - Prob. 30.4.3CPCh. 30.4 - Prob. 30.4.4CPCh. 30.4 - Prob. 30.4.5CPCh. 30.4 - Write a statement to obtain an array of 1000...Ch. 30.5 - Prob. 30.5.1CPCh. 30.5 - Prob. 30.5.2CPCh. 30.5 - Prob. 30.5.3CPCh. 30.5 - Prob. 30.5.4CPCh. 30.6 - Prob. 30.6.1CPCh. 30.7 - Prob. 30.7.1CPCh. 30.8 - Can the following code be used to replace line 19...Ch. 30.8 - Prob. 30.8.2CPCh. 30.8 - Prob. 30.8.3CPCh. 30.8 - Prob. 30.8.4CPCh. 30.8 - Write the code to obtain a one-dimensional array...Ch. 30 - Prob. 30.1PECh. 30 - Prob. 30.2PECh. 30 - Prob. 30.3PECh. 30 - (Print distinct numbers) Rewrite Programming...Ch. 30 - Prob. 30.5PECh. 30 - Prob. 30.6PECh. 30 - Prob. 30.7PECh. 30 - Prob. 30.8PECh. 30 - Prob. 30.9PECh. 30 - Prob. 30.10PECh. 30 - Prob. 30.11PECh. 30 - (Sum the digits in an integer) Rewrite Programming...Ch. 30 - (Count the letters in a string) Rewrite...Ch. 30 - Prob. 30.14PECh. 30 - (Display words in ascending alphabetical order)...Ch. 30 - Prob. 30.16PECh. 30 - Prob. 30.17PECh. 30 - (Count the occurrences of words in a text file)...Ch. 30 - (Summary information) Suppose the file test.txt...
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 the InputLicenses() function in the Database class. Within InputLicenses(), use cin to read pairs of inputs, character currRenewable and string currState, until 'D' is read from input. Create a License object with currRenewable and currState as arguments and append the object to vector licenseList. Ex: If the input is N MS N NY Y NE Y HI D, then the output is: License renewable: N, State: MS License renewable: N, State: NY License renewable: Y, State: NE License renewable: Y, State: HI 1 #include 2 #include 3 using namespace std; 4 5 class License { 6 7 8 9 public: void Set Details (char newRenewable, string newstate); void Print () const; Check private: 10 11 12 }; 13 14 void License::SetDetails (char newRenewable, string newState) ( 15 16 17) 18 char renewable; string state; renewable state newState; newRenewable; Next level 2 CS Scanned with CamScanner 3 Feedback?arrow_forwardJava Program: There are errors in the lexer and shank file. Please fix those errors and there must be no error in any of the code at all. Below is the lexer, shank, and token files. The shank file is the main method. There is a rubric attached as well. Lexer.java import java.util.ArrayList;import java.util.HashMap;import java.util.List; import mypack.Token.TokenType; public class Lexer { private static final int INTEGER_STATE = 1;private static final int DECIMAL_STATE = 2;private static final int IDENTIFIER_STATE = 3;private static final int SYMBOL_STATE = 4;private static final int ERROR_STATE = 5;private static final int STRING_STATE = 6;private static final int CHAR_STATE = 7;private static final int COMMENT_STATE = 8; private static final char EOF = (char) -1; private static String input;private static int index;private static char currentChar;private static int lineNumber = 1;private static int indentLevel = 0;private static int lastIndentLevel = 0; private static…arrow_forwardThis question is in Java. We are required to map over some data and incement by 10. import.java.util.stream.Collectors; import.java.util.stream.Stream public class IncrementTheData implements Assignment {public Object solution(ArrayList<Integer> nums) { Stream.of(1,2,3,4,5,6) .map(not sure what would go in here) .collectors(Collectors.toList())return null;}} //So this is as far as I got with this question. The instructions are vague but I think I'm on the right track. Am I?arrow_forward
- A map is a container object that stores a collection of key/value pairs. It enables fast retrieval, deletion, and updating of the pair through the key. A map stores the values along with the keys. The keys are like indexes. In List, the indexes are integers. In Map, the keys can be any objects. A map cannot contain duplicate keys. Each key maps to one value. A key and its corresponding value form an entry stored in a map. There are three types of maps: HashMap, LinkedHashMap, and TreeMap. The common features of these maps are defined in the Map interface. 1.Using the Map interface knowledge, create a Java application in NetBeans that implements a HashMap and a LinkedHashMap. The application must do the following: a. Add at least 5 elements to the HashMap b. Print out all the elements in the HashMap including their keys c.Find and print out the value of a specific indexd. Remove one of the elements from the HashMap e. Print out the HashMap after removing the element f. Add at least 5…arrow_forwardint binsearch (int X , int V [] , int n ) { int low , high , mid , i ; low = 0; high = n - 1; for ( i = 0; i < high ; i ++) { if( V[ i ] > V [ i +1]) return -2; } while ( low <= high ) { mid = ( low + high )/2; if ( X < V [ mid ]) high = mid - 1; else if ( X > V [ mid ]) low = mid + 1; else return mid ; } return -1; } This code takes as input a sorted array V of size n, and an integer X, if X exists in the array it will return the index of X, else it will return -1. 1. Draw a CFG for binsearch(). 2. From the CFG, identify a set of entry–exit paths to satisfy the complete statement coverage criterion. 3. Identify additional paths, if necessary, to satisfy the complete branch coverage criterion. 4. For each path identified above, derive their path predicate…arrow_forwardimport java.util.LinkedList; import java.util.Scanner; import java.util.Arrays; import java.io. File; import java.io.FileNotFoundException; public class Ch6Lab{ public static void main(String[] args) throws FileNotFoundException{ LinkedList numbers = new LinkedList(); Scanner fileIn = new Scanner (new File("input.txt")); while (fileIn.hasNextInt()){ int x = fileIn.nextInt(); numbers.add(x); } public static void sort(Linkedlist 1){ ; //TODO: Write a sort method that sorts the linked list } public static Integer min(LinkedList 1){ return e; //TODO0: Write a method that returns the minimum value from the linked 1ist } public static Integer max(LinkedList 1){ return 0; //TODO: Write a method that returns the maximum value from the linked list public static double mean (LinkedList 1){ return 0.0; //TODO: Write a method that returns the mean of the values from the linked list } public static double median(LinkedList 1){ return 0.0;arrow_forward
- Please check the instructions on the images given. Sample output are also given on the image while the code for modification is provided below. hash.c #include <stdlib.h>#include <stdio.h> struct Node { int val; struct Node * next;}; struct HashTable { int size; struct Node ** table;}; struct Node * create_node(int val);struct HashTable * create_table(int size);void destroy_table(struct HashTable * h);void display_table(struct HashTable *h);int hash_function(int key, int size);void insert(struct HashTable *h, int val);int search(struct HashTable * h, int val);struct Node * delete(struct HashTable * h, int val); void main(){struct HashTable * h = create_table(8);display_table(h); int val_insert[12] = {12, 31, 45, 83, 72, 29, 84, 39, 61, 24, 10, 50}; for (int i=0; i<12; i++) { insert(h,val_insert[i]);}display_table(h); int val_search[4] = {29, 99, 72, 20};for (int i=0; i<4; i++) { int result = search(h,val_search[i]); printf("Search value %2d:…arrow_forwardIn this programming exercise you will implement two functions. The first function will prompt the user for a file containing the number of vertices and entries of the adjacency matrix of a graph. It will return a two-dimensional list (a list of lists) containing the adjacency matrix. The textfile is named inputfilename.txt am trying to read for the matrix [[0, 1, 2, 3, 100, 100, 100, 100], [1, 0, 2, 100, 3, 4, 100, 100], [2, 2 0, 4, 4, 100, 5, 100], [3, 100, 4, 0, 100, 100, 4, 100], [100, 3, 4, 100, 0, 3, 3, 3], [100, 4, 100, 100, 3, 0, 100, 1], [100, 100, 5, 4, 3, 100, 0, 2], [100, 100, 100, 100, 3, 1, 2, 0]] def readMatrix(inputfilename): ''' Returns a two-dimentional array created from the data in the given file. Pre: 'inputfilename' is the name of a text file whose first row contains the number of vertices in a graph and whose subsequent rows contain the rows of the adjacency matrix of the graph. ''' # Open the file f =…arrow_forwardExecute an online dictionary (with a limited list of words) which makes use ofinterpolation search to search through the dictionary given a word. Refine theprogram to correct any misspelled word with the nearest and/or the correct wordfrom the dictionary.arrow_forward
- import ADTs.QueueADT;import DataStructures.ArrayStack;import ADTs.StackADT;import DataStructures.LinkedQueue;import java.util.Scanner; /**** @author Qiong*/public class RepeatStrings {public static void main(String[] argv) throws Exception{final int SIZE = 3;Scanner keyboard = new Scanner(System.in);QueueADT<String> stringQueue;//stringQueue = new CircularArrayQueue<String>(SIZE);stringQueue = new LinkedQueue<String>();StackADT<String> stringStack;stringStack = new ArrayStack<String>(SIZE);String line;for (int i = 0; i < SIZE; i++){System.out.print("Enter a line of text which includes only 3 words > ");line = keyboard.nextLine();//TODO enque the new element//TODO push the new element}System.out.println("\nOrder is: ");for (int i = 0; i < SIZE; i++){// TODO Remove an element in the order in which we input strings// Save it to the String variable, named lineSystem.out.println(line);}System.out.println("\nOpposite order is: ");for (int i = 0; i <…arrow_forwardWhat is the output of the following code? int[] a = {10, -28, 33, 28, -49, 56, 49}; Arrays.stream(a) .map(Math::abs) .forEach(System.out::println);arrow_forwardA map is a container that stores a collection of ordered pairs, each pair consists of a key and a value, <key, value>. Keys must be unique. Values need not be unique, so several keys can map to the same values. The pairs in the map are sorted based on keys. Group of answer choices True Falsearrow_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