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
Question
Chapter 30.3, Problem 30.3.1CP
Program Plan Intro
Purpose of given code:
Purpose of given code is to implements the aggregate operations for “IntStream”, “LongStream”, and “DoubleStream” for processing primitive “int”, “long”, and “double” values.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
void radixSort(int arr[], int n)
{
intm=getMax(arr, n);
for (intexp=1; m/exp>0; exp*=10)
countSort(arr, n, exp);
}
void printData(int arr[], int start, int len)
{
if( start>=len )
return( 0 );
printf("%d\n", arr[start]);
printData(arr, start+1, len);
}
int main()
{
intarr[]= {8, 9, 3, 4, 7, 2, 5, 6, 1};
intn=sizeof(arr) /sizeof(arr[0]);
radixSort(arr, n);
printData(arr, 0, n);
return0;
}
In MIPS
extern "C" int f(int *,int,int);
int a[2][2] = {{11,12},{21,22}};
void setup(){ Serial.begin(115200); while(!Serial); delay(500); int *arr = (int*)a; Serial.println(f(arr,2,2));
}
void loop(){
}
.global f
f: ldr r3,[r0] // get first element
mov r2,#0add r2,r3
mov r1, #3
lp:
add r0,#4 // add next elementldr r3,[r0]add r2,r3sub r1,#1
bgt lp
mov r0,r2
bx lr
Describe what operation is being performed in this code
public class testRun{public static int find(int[] data, int target,int start, int end) {int[] stored = sort(data);if (start <= end) {int midPoint = (start + end / 2);if (stored[midPoint] == target) {return midPoint;}if (stored[midPoint] > target) {return find(data, target, start, midPoint - 1);//return first half,exclusive itself}if (stored[midPoint] < target) {return find(data, target, start, midPoint + 1);//return last half,exclusive itself.}}return -1;}public static int[] sort(int[] data){// Find the smallest element in the listfor (int i = 0; i < data.length -1 ; i++){ //generate the index position,not =< b/c goes outer boundint min = i; //assign index position to min in each iterationfor (int j = i + 1; j < data.length ; j++){if (data[j] < data[min]){ //if the element in the second index number smaller than// the element in previous index numbermin = j; // assign j to the smallest number}}swap (data,i,min);// data[i] = min the smallest number assign to…
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
Similar questions
- 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…arrow_forwardvoid getInput(){for(int i =0; i < studentName.length; i++){System.out.print("Student name: ");studentName[i] = keyboard.nextLine();System.out.print("Studnet ID: ");midTerm1[i] = keyboard.nextInt();}keyboard.close();} Can't put full student name becuase nextLine();arrow_forwardvoid doo(list &L){ int item,a,p=L.size()-1; L.retrieve(p,a); for(int i=0;iarrow_forwarddef findOccurrences(s, ch): lst = [] for i in range(0, len(s)): if a==s[i]: lst.append(i) return lst Use the code above instead of enumerate in the code posted below. n=int(input("Number of rounds of Hangman to be played:")) for i in range(0,n): word = input("welcome!") guesses = '' turns = int(input("Enter the number of failed attempts allowed:")) def hangman(word): secrete_word = "-" * len(word) print(" the secrete word " + secrete_word) user_input = input("Guess a letter: ") if user_input in word: occurences = findOccurrences(word, user_input) for index in occurences: secrete_word = secrete_word[:index] + user_input + secrete_word[index + 1:] print(secrete_word) else: user_input = input("Sorry that letter was not found, please try again: ") def findOccurrences(s, ch): return [i for i, letter in enumerate(s) if letter == ch] *** enumerate not discussed in…arrow_forwardDetermine the output.namespace DataStructures{class Program{static void Main(string[] args){int[] myArray = { 1, 3, 2, 4 };Sort(myArray, 0, myArray.Length - 1);}static void Sort(int[] myArray, int left, int right){if ((right - left) >= 1){int middle1 = (left + right) / 2;int middle2 = middle1 + 1;DisplayArray(myArray, left, right);DisplayArray(myArray, left, middle1);DisplayArray(myArray, middle2, right);Console.WriteLine("___________________________________________");Sort(myArray, left, middle1);Sort(myArray, middle2, right);Combine(myArray, left, middle1, middle2, right);} }static void Combine(int[] myArray, int left, int middle1, int middle2, int right) {int[] combined = new int[myArray.Length];int leftindex = left;int rightindex = middle2;int combinedindex = left;DisplayArray(myArray, left, middle1);DisplayArray(myArray, middle2, right);while (leftindex <= middle1 && rightindex <= right){if (myArray[leftindex] > myArray[rightindex])combined[combinedindex++] =…arrow_forwardHelp me to change this code in java language: Arrays.sort(hand, (c1, c2) -> { if(c1.rank != c2.rank) { return c2.rank - c1.rank; } // In case of same rank, order by suit return c1.suit - c2.suit; });arrow_forwarddef strPattern(mystr): lenght = len(mystr) mystr1 = "" for i in range(lenght - 1): mystr1 = mystr1 + mystr[i].upper() + str(i + 1) if lenght == 0: return mystr1 return mystr1 + mystr[-1].upper() s = input("enter a word: ") print(strPattern(s)) s = input("enter a word: ") EOFError: EOF when reading a line how can i fix this errorarrow_forwardTurn this into a flowchart/pseudo code. //This is where the functions go void insertfront(int data);void insert(int data);void display();void deletedata(int data);void reverselist();void searchdata(int data);void swap();void datasort();void deleteList(); #include <iostream>#include <stdlib.h>using namespace std; struct Node {int data;struct Node *next;}; struct Node* head = NULL;struct Node* rhead = NULL;int count1; //insert in front for reversedlistvoid insertfront(int data){Node* new_node = (Node*) malloc(sizeof(Node)); new_node->data = data; new_node->next = rhead; rhead=new_node;}//insert at endvoid insert(int new_data){Node* ptr;ptr = head;Node* new_node = (Node*) malloc(sizeof(Node)); new_node->data = new_data; new_node->next = NULL;if (head == NULL) { head = new_node; } else{while (ptr->next!= NULL) { ptr = ptr->next;}ptr->next=new_node;}count1++;}//display listvoid display() {struct Node* ptr;ptr = head;if(head==NULL){cout<<"Sorry the list…arrow_forwardsortLecNotes sortsearchassigncodeex1.java sort, search for a specific student package sortsearchassigncodeex1; import java.util.Scanner; import java.io.*; // // public class Sortsearchassigncodeex1 { // public static void fillArray(Scanner inputFile, int[] arrIn){ int indx = 0; //Complete code { arrIn[indx] = inputFile.nextInt(); indx++; } } //=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- public static void displayArray(int[] arrIn){ for(int indx=0; indx<arrIn.length;indx++) System.out.printf("student %2d sID: %5d\n",(indx+1),arrIn[indx]); } //=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- public static int searchArray(int[] arrIn, int sValue){ int retValue = -1; // if the value is not found method will return -1 for(int indx=0; //Complete code ;indx++) if(arrIn[indx] == sValue) retValue = indx; return retValue; }…arrow_forwardConsider the following function: public void bSearch(int[] A, int value, int start, int end) { if (end value) { return bSearch(A, value, start, mid); } else if (value > A[mid]) { return bSearch(A, value, mid+1, end); } else { return mid; } } The mutation program P' changes the part as shown below. } else if (value > A[mid]) { return bSearch(A, value, mid+2, end); } else { return mid; } A test input is given t1: {A = [2, 3, 5, 7, 10, 11], value = 6, start=0, end=5}. Which statement below best describes the mutant with regards to the test input? O a. t1 resolves mutant P O b. The mutant P' with regards to test input t1 is live.arrow_forwardsolve in java Integer arrays groceryItemPrices and stockRecords are read from input, containing the prices and stock records of each grocery item. Initialize variable count with 0. For each grocery item, increment count if a grocery item meets both of the following conditions: Price is greater than 20. Stock record is less than 20. Lastly, output count followed by a newline. Ex: For the input: 28 14 21 22 7 9 17 24 18 10 20 26 then the output is: 3 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 import java.util.Scanner; public class CombineArrays { publicstaticvoidmain(String[] args) { Scannerscnr=newScanner(System.in); finalintNUM_VALS=6; int[] groceryItemPrices=newint[NUM_VALS]; int[] stockRecords=newint[NUM_VALS]; inti; intcount; for (i=0; i<NUM_VALS; ++i) { groceryItemPrices[i] =scnr.nextInt(); } for (i=0; i<NUM_VALS; ++i) { stockRecords[i] =scnr.nextInt(); } /* Your code goes here */arrow_forwardb) int [] num = new int [6]; for (int i = 1; i 2) { num [i] = 2 * num[i]-num[i-1]; System.out.println( "num [" + i + ") =" + num [i]);arrow_forwardarrow_back_iosSEE MORE QUESTIONSarrow_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