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.2CP
Explanation of Solution
Purpose of given code:
The purpose of given code is to print resultant element in array variable “m” with “IntStream” class using aggregate functions. It multiples all the values in array with stream object “e1*e2” using “reduce()” method...
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
This 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?
void ExtractMinimumWeightPath(int path[MAX], int weights[MAX][MAX], int pathWeights[MAX][MAX], int rowc, int colc){int rowsCount = rowc;int colsCount = colc;path[rowsCount];int col = 0;int i = 0;for(i=1;i<colsCount;i++){if(pathWeights[rowsCount-1][i]<pathWeights[rowsCount-1][col]){col = i;}}
int row = rowsCount-1;do{path[row] = col + 1;if (col>0 && pathWeights[row-1][col-1] + weights[row][col] == pathWeights[row][col]){col = col - 1;}
else if (col < colsCount-1 && pathWeights[row-1][col+1] + weights[row][col] == pathWeights[row][col]){col = col + 1;}row--;}
while(row>0);path[0] = col + 1;}
This is a code in C, I need to change the code as much as possible, but on condition to perform the same work as this.
Changing the var names and the loops is enough
int 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…
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
- What 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_forwardJava 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 =…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_forward
- what is the problem in this code ? def add():id = input("Enter ID:")f = open("data.txt", "r")id_list = []lines = f.readlines()if lines != "":for line in lines:token = line.split(" ")id_list.append(token[0])for i in id_list:if i == id:print("The student record is already in the database!Zero records added")returnf.close()file = open("data.txt", "a")name = input("Enter name: ")course = input("Enter course: ")absences = int(input("Enter absences: "))exam1 = int(input("Enter exam 1 grade: "))exam2 = int(input("Enter exam 2 grade: "))marks = int(input("Enter Total Marks: "))s = id+" "+name+" "+course+" "+str(absences)+" "+str(exam1)+" "+str(exam2)+" "+str(marks)+"\n"file.write(s)file.close()while True:print("1.Add a student")print("Any other numeric to terminate")choice = int(input())if choice == 1:add()else:breakarrow_forwardPerson receives text (string) messages on his/her phone. Message memory of a phone is very limited. A buffer is provided for storing messages when phone memory gets full. Message from buffer is loaded into phone memory when space is available. Messages are moved from buffer to phone in such a way that first received message is viewed first on screen. Implement buffer only using array. question solved in data structurearrow_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
- Given the following function and a Linked List : head->a->b->c->d->e->f->g->null, where a,...g are void fun1(Node head) { if(head == null) return; System.out.printf("%d ", head.data); fun1(head.link.link); } What does the call fun1(head) do? Binary search tree properties.arrow_forwardA 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.arrow_forwardWrite 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_forward
- Suppose Arr is a very large array of integer elements. The size of Arr is unknown. The first k elements are positive integers, greater than 0 and less than 1000, in increasing sorted order. The rest of the elements are greater than 1000.Write a function that determines whether a given positive integer, key, of value less than 1000 is an element in Arr or not. If the key is present in Arr, it returns its index otherwise it returns -1. The Time Complexity of the function shall be O(log(n)).(Note: It is to be remembered that both the size of Arr and k are unknown.)Array index is starting from 1 not 0 [pseudo code needed]Example:Arr: 4 5 7 12 15 24 67 221 233 430 500 1100 1200 1150 1050 1200 …key: 15returned value: 5Arr: 5 9 9 12 19 29 67 67 120 220 330 400 700 1001 1100 1150 1050 11250 1200 …key: 900returned value: -1arrow_forwardPlease 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_forwardWrite a program that first gets a list of integers from input. The input begins with an integer indicating the number of integers that follows. Then, get the last value from the input, and output all integers less than or equal to that value. Ex: If the input is: 5 50 60 140 200 75 100 the output is: 50 60 75 The 5 indicates that five integers are in the list, namely 50, 60, 140, 200, and 75. The 100 indicates that the program should output all integers less than or equal to 100, so the program outputs 50, 60, and 75. Such functionality is common on sites like Amazon, where a user can filter results. Utilizing functions will help to make your main very clean and intuitive. The program must define the following two functions: def get_user_values () - read from input the size of the list, the integers in the list, and the threshold value. Return the list of integers and the threshold value. def ints_less_than_or_equal_to_threshold (user_values, upper_threshold) - create a new list that…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