![EBK BUILDING JAVA PROGRAMS](https://www.bartleby.com/isbn_cover_images/9780134323718/9780134323718_largeCoverImage.jpg)
EBK BUILDING JAVA PROGRAMS
4th Edition
ISBN: 9780134323718
Author: Stepp
Publisher: PEARSON CUSTOM PUB.(CONSIGNMENT)
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 19, Problem 9E
Explanation of Solution
“stdev” method:
//definition of "stdev" method
public static double stdev (double[] a)
{
// declare the variable
double avg = DoubleStream.of (a).average().getAsDouble();
/*return the standard deviation of the doubles in an array*/
return DoubleStream.of (a)
//call the "map" method
.map(n -> Math.pow (n – avg, 2))
//call the "average" method
...
Expert Solution & Answer
![Check Mark](/static/check-mark.png)
Want to see the full answer?
Check out a sample textbook solution![Blurred answer](/static/blurred-answer.jpg)
Students have asked these similar questions
Write a Java method that takes an array of type int and returns a boolean value. The
method returns true if the number of positive elements in the parameter array is
larger than the number of negative elements. The method returns false if any of the
following conditions is satisfied:
• The parameter array is of length of O or 1
• The number of positive elements of the parameter array is less than or equal
to the number of negative elements
• The number of positive elements or negative elements is equal to zero
The method's header is as follows.
public static boolean verify (int[] x)
Sample run
int[] x =
boolean b =
Result
{1, 2, 3};
false
verify(x);
int[] x = (5};
boolean b =
false
verify(x);
int[] x = {1, 2, 3, -5, -1};
verify(x);
int[] x = new int[@];
verify(x);
true
boolean b% =
false
boolean b% =
+v
Paragraph
Write a Java method that takes an array of type int and returns a boolean value. The
method returns true if the number of positive elements in the parameter array is
larger than the number of negative elements. The method returns false if any of the
following conditions is satisfied:
• The parameter array is of length of 0 or 1
• The number of positive elements of the parameter array is less than or equal
to the number of negative elements
• The number of positive elements or negative elements is equal to zero
The method's header is as follows.
public static boolean verify (int[] x)
Sample run
Result
int[] x =
(1, 2, 3};
verify(x);
{5};
verify(x);
int[] x = {1, 2, 3, -5, -1};
boolean b = verify(x);
int[] x = new int[0];
verify(x);
false
boolean b =
int[] x =
boolean b =
false
true
false
boolean b =
BIU A
Paragraph
+v
Write a method that returns the sum of all the elements in a specified column in a matrix using the following header:
public static double sumColumn (double[][] m, int columnIndex)
Write a (test) program that reads a 3-by-4 matrix and displays the sum of each column. Here is a sample run:
Enter a 3-by-4 matrix:
1.5 2 3 4
5.5 6 7 8
9.5 1 3 1
Sum of the elements at column 0 is 16.5
Sum of the elements at column 1 is 9.0
Sum of the elements at column 2 is 13.0
Sum of the elements at column 3 is 13.0
Chapter 19 Solutions
EBK BUILDING JAVA PROGRAMS
Ch. 19.1 - Prob. 1SCPCh. 19.1 - Prob. 2SCPCh. 19.1 - Prob. 3SCPCh. 19.1 - Prob. 4SCPCh. 19.2 - Prob. 5SCPCh. 19.2 - Prob. 6SCPCh. 19.2 - Prob. 7SCPCh. 19.2 - Prob. 8SCPCh. 19.3 - Prob. 9SCPCh. 19.3 - Prob. 10SCP
Ch. 19.3 - Prob. 11SCPCh. 19.3 - Prob. 12SCPCh. 19.3 - Prob. 13SCPCh. 19.3 - Prob. 14SCPCh. 19.4 - Prob. 15SCPCh. 19.4 - Prob. 16SCPCh. 19.4 - Prob. 17SCPCh. 19.5 - Prob. 18SCPCh. 19.5 - Prob. 19SCPCh. 19.5 - Prob. 20SCPCh. 19.5 - Prob. 21SCPCh. 19.5 - Prob. 22SCPCh. 19.5 - Prob. 23SCPCh. 19 - Prob. 1ECh. 19 - Prob. 2ECh. 19 - Prob. 3ECh. 19 - Write a method totalCircleArea that uses stream...Ch. 19 - Prob. 5ECh. 19 - Prob. 6ECh. 19 - Prob. 7ECh. 19 - Prob. 8ECh. 19 - Prob. 9ECh. 19 - Prob. 10ECh. 19 - Prob. 11ECh. 19 - Prob. 12E
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 method that sums all the numbers in the major diagonal in an n x n matrix of double values using the following header:public static double sumMajorDiagonal(double[][] m)Write a test program that first prompts the user to enter the dimension n of an n x n matrix, then asks them to enter the matrix row by row (with the elements separated by spaces). The program should then print out the sum of the major diagonal of the matrix.arrow_forwardWrite a method printSquares that uses recursive backtracking to find all ways to express an integer as a sum of squares of unique positive integers. For example, the call of printSquares(200); should produce the following output:1^2 + 2^2 + 3^2 + 4^2 + 5^2 + 8^2 + 9^21^2 + 2^2 + 3^2 + 4^2 + 7^2 + 11^21^2 + 2^2 + 5^2 + 7^2 + 11^21^2 + 3^2 + 4^2 + 5^2 + 6^2 + 7^2 + 8^21^2 + 3^2 + 4^2 + 5^2 + 7^2 + 10^22^2 + 4^2 + 6^2 + 12^22^2 + 14^23^2 + 5^2 + 6^2 + 7^2 + 9^26^2 + 8^2 + 10^2Some numbers (such as 128 or 0) cannot be represented as a sum of squares, in which case your method should produce no output. Keep in mind that the sum has to be formed with unique integers. Otherwise you could always find a solution by adding 1^2 together until you got to whatever number you are working with.As with any backtracking problem, this one amounts to a set of choices, one for each integer whose square might or might not be part of your sum. In many of our backtracking problems we store the choices in…arrow_forwardWrite a method that returns the sum of all the elementsin a specified row in a matrix using the following header:public static double sumRow(double[][] m, int rowIndex)Point Write a test program that reads a 3-by-4 matrix and displays the sum of each row.Here is a sample run:Enter a 3−by−4 matrix row by row:1.5 2 3 4 ↵Enter5.5 6 7 8 ↵Enter9.5 1 3 1↵Enter Sum of the elements at row 0 is 10.5Sum of the elements at row 1 is 26.5Sum of the elements at row 2 is 14.5arrow_forward
- 5. Write a static method largestColumnFirst() that receives as parameter a 2D array numAr,finds the column with the largest sum, and switches it with the first column. For example:6 7 9 4 8 9 7 6 4 83 2 7 4 1 → 7 2 3 4 19 4 5 8 3 5 4 9 8 3arrow_forwardWrite a method that sums all the numbers in the major diagonal in an nxn matrix of double values using the following header: public static double sumMajorDiagonal(double[][] m) Write a test program that first prompts the user to enter the dimension n of an nxn matrix, then asks them to enter the matrix row by row (with the elements separated by spaces). The program should then print out the sum of the major diagonal of the matrix. Write a method that sums all the numbers in the major diagonal in an nxn matrix of double values using the following header: public static double sumMajorDiagonal(double[][] m) Write a test program that first prompts the user to enter the dimensionn of an n xn matrix, then asks them to enter the matrix row by row (with the elements separated by spaces). The program should then print out the sum of the major diagonal of the matrix. SAMPLE RUN #1: java SumMajorDiagonal Standard Output Hide invisibles Enter - dimension n-of nxn-matrix:Enter-row-0:…arrow_forwardWrite a method printSquares that uses recursive backtracking to find all ways to express an integer as a sum of squares of unique positive integers. For example, the call of printSquares(200); should produce the following output:1^2 + 2^2 + 3^2 + 4^2 + 5^2 + 8^2 + 9^21^2 + 2^2 + 3^2 + 4^2 + 7^2 + 11^21^2 + 2^2 + 5^2 + 7^2 + 11^21^2 + 3^2 + 4^2 + 5^2 + 6^2 + 7^2 + 8^21^2 + 3^2 + 4^2 + 5^2 + 7^2 + 10^22^2 + 4^2 + 6^2 + 12^22^2 + 14^23^2 + 5^2 + 6^2 + 7^2 + 9^26^2 + 8^2 + 10^2Some numbers (such as 128 or 0) cannot be represented as a sum of squares, in which case your method should produce no output. Keep in mind that the sum has to be formed with unique integers. Otherwise you could always find a solution by adding 1^2 together until you got to whatever number you are working with.As with any backtracking problem, this one amounts to a set of choices, one for each integer whose square might or might not be part of your sum. In many of our backtracking problems we store the choices in…arrow_forward
- Write a recursive method that gets three parameters as input: an array of integers called nums, an integer called index,and an integer called The purpose of this method is to return true if value is stored in the array starting at nums[index]. That is, you have to check if value is equal to nums[index] or nums[index +1] or nums[index +2 ] …. nums[nums.length -1]. Do not use loops.(java code)arrow_forwardIn java, Write a method checks if a given matrix is a unit matrix. An N x N unit matrix is a matrix of N rows and N columns where all the diagonal elements are ‘1’s and all the remaining elements are ‘0’s. The method should take a 2D array of integers as argument and return a Boolean which is true/false depending on whether the matrix corresponding to the 2D array is a unit matrix or not. Test the method in the ‘main’ method. For problems asking for 'methods', you need to write the method, and the 'main' method which is used as a 'driver' to test the given method.arrow_forwardWrite a method checks if a given matrix is a unit matrix. An N x N unit matrix is a matrix of N rows and N columns where all the diagonal elements are ‘1’s and all the remaining elements are ‘0’s. The method should take a 2D array of integers as argument and return a Boolean which is true/false depending on whether the matrix corresponding to the 2D array is a unit matrix or not. Test the method in the ‘main’ method. For problems asking for 'methods', you need to write the method, and the 'main' method which is used as a 'driver' to test the given method.arrow_forward
- In java language using arrays This method examines the two-dimensional array of integersidentified by the first parameter, whose length (number of rows,also the number of students) is the second parameter, while thethree columns in the array represent the scores for threedifferent tests.The test scores for each student (one row of three grades) arecombined to find the average score for each student. The integerreturned is the number of students with a test average less than 70. @param numStudents, the number of students who took the three tests@param theArray, a 2-D array of integer scores@return, the number of test averages below a score of 70*/public static int testAverage(double[][] theArray, int numStudents){int NUM_TESTS = 3; // your work here // loop though theArray, computing each student's average // your work here// return count of averages below 70.0 // your work herearrow_forwardmplement a Java program that applies the Newton-Raphson's method xn+1 = xn – f(xn) / f '(xn) to search the roots for this polynomial function ax6 – bx5 + cx4 – dx3+ ex2 – fx + g = 0. Fill out a, b, c, d, e, f, and g using the first 7 digits of your ID, respectively. For example, if ID is 4759284, the polynomial function would be 4x6 – 7x5 + 5x4 – 9x3+ 2x2 – 8x + 4 = 0. The program terminates when the difference between the new solution and the previous one is smaller than 0.00001 within 2000 iterations. Otherwise, it shows Not Found as the final solution.arrow_forwardWrite a C++ program that defines an array of integers, add a method, removeDuplicate(), that removes duplicates from the array. When a duplicate element is found, the discovered element must be replaced by zero. Display the elements of the array before and after duplicates are removed. For example, if the elements of the array are: 2 711461392 After the duplicates are removed, the elements of the array are: 2710460390 To implement the code to remove the duplicate integers, use the code I provide and insert your code in the removeDuplicate() method to perform the task. After you complete the code, what is the Big(0) of your removeDuplicate( ) method? Hinclude using namespace stdj int a (] = (2, 7, 1, 1, 4, 6, 1, 3, 9, 2}3 int size = sizeof(a)/sizeof(a[@]); void displayarray() { for(int i = 0j i e sizej i++) { cout « a[i] « * *i cout « endl; void removeDuplicate() { Write your C+ code to remove the duplicate integers in this method. int main() { displayArray(); removeDuplicate();…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 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
![Text book image](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
![Text book image](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
![Text book image](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
![Text book image](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
![Text book image](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
![Text book image](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
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