Introduction to Java Programming and Data Structures: Brief Version (11th Global Edition)
11th Edition
ISBN: 9780134671710
Author: Y. Daniel Liang
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Expert Solution & Answer
Chapter 30.3, Problem 30.3.2CP
Explanation of Solution
Purpose of given code:
Purpose of given code is to display the count value, maximum value, minimum value, sum value, and average value of integer array “numbers”.
Given code:
//Variable definition
int[] numbers = {1, 4, 2, 3, 1};
/*Error #1*/
DoubleSummaryStatistics stats = DoubleStream.of(numbers).summaryStatistics();
/*Print statement with aggregate functions*/
/*Error #2*/
System.out.printf("The summary of the stream is\n%-10s%10d\n" +"%-10s%10.2f\n%-10s%10.2f\n%-10s%10.2f\n%-10s%10.2f\n"," Count:", stats.getCount(), " Max:", stats.getMax()," Min:", stats.getMin(), " Sum:", stats.getSum()," Average:", stats.getAverage());
Error #1:
The values of variable “numbers” are in “int” array. The above program uses “DoubleSummaryStatistics” instead of “IntSummaryStatistics”.
Error #2:
The resultant minimum, maximum, and sum value is integer...
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Write a loop that finds the smallest value. Print it and the index
code format:
#include <iostream>using namespace std;
#include <cstdlib> // required for rand()
int main(){// Put Part2 code here
// Declare smallestFoundSoFar// Q: what should be its initial value?int indexOfSmallest = -1;// sign that it is not initialized
Part 2 code
#include <iostream>
using namespace std;
// part 1 code#include <cstdlib>
int main()
{
srand(17);
const int ARRAYSIZE = 20; // size for the array
int RandArray[ARRAYSIZE]; // array declared
int i; // to iterate the loop
// this loop will store thei random number in the array
for (i = 0; i < ARRAYSIZE; i++)
RandArray[i] = rand() % 100;
// this loop will print the array
for (i = 0; i < ARRAYSIZE; i++)
cout <<"randArray["<< i <<"]=" << RandArray[i] << endl;
int largestFoundSoFar=-1; // anything is larger than this!
int indexOfLargest = -1; // sign that it is not initialized
for (i = 0; i…
The following program reads a comma separated value (CSV) file of student grades. Each line
of the file contains two values: the student ID and the grade. For example
ID534240025, A-
Complete the following loop that reads the file and extracts the two values into the variables
student and grade.
infile = open("studentList.csv")
for line in infile:
line line.strip()
student, grade =
=
#include <stdio.h>
#include <string.h>
int IsPasswordOkay(char* pass)
{
char Password[12];
strcpy(Password, pass);
if (!strcmp(Password, "goodpass")) return(1);
else return(0);
}
int main(int argc, char **argv)
{
int PwStatus;
if (argc < 2) {
printf("Input your password\n");
return(-1);
}
PwStatus = IsPasswordOkay(argv[1]);
if (PwStatus == 0) {
printf("Acces denied");
return(-1);
}
else {
printf("Access granted");
return(1);
}
}
Write a function to conduct input validation to secure the smallest buffer. You may call this function void SecurePasswordBuffer(const char *arg).
Chapter 30 Solutions
Introduction to Java Programming and Data Structures: Brief Version (11th Global 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
- Turn 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_forwardWrite your codes in m.file Put a leaf right next to this flower. make additions to this code n=800;r=linspace(0,1,n);theta=linspace(0,2*pi,n);[R,THETA]=ndgrid(r,theta);% define the number of petals we want per cycle. Violets have 5!petalNum=5;x = 1 - (1/2)*((5/4)*(1 - mod(petalNum*THETA, 2*pi)/pi).^2 - 1/4).^2;% update the formula for phi to stop the spiralling effectphi = (pi/2)*exp(-2*pi/(8*pi));y = 1.95653*(R.^2).*(1.27689*R - 1).^2.*sin(phi);R2 = x.*(R.*sin(phi) + y.*cos(phi));X=R2.*sin(THETA);Y=R2.*cos(THETA);Z=x.*(R.*cos(phi)-y.*sin(phi));% color code for blueviolet RGB 138,43,226% Indigo rgb value (75,0,130)mapSize=20;blue_map=linspace(138,75,mapSize)';blue_map(:,2)=linspace(43,0,mapSize)';blue_map(:,3)=linspace(226,130,mapSize)';% and a pretty bit in the middlegold_map=[255 215 0; 250 210 0];% combine to form a full flower mapviolet_map=[gold_map; blue_map];% Now lets plot it and try and pick an attractive anglesurf(X,Y,Z,'LineStyle','none')colormap(violet_map/255)view([-12.700…arrow_forwardThis code gets an error for going out of range in the last for loop. What can I do to fix this? # Lucas Conklin# 5772707import csvimport statistics def readCSVIntoDictionary(f_name): data = [] with open(f_name) as f: reader = csv.reader(f) for row in reader: if not data: for index in range(len(row)): data.append([]) for index in range(len(row)): data[index].append(float(row[index])) f.close() return data features = readCSVIntoDictionary("C:\\Users\\lucas\\Downloads\\pima.csv")print(features) def find_median_and_SD(data, feature): med = statistics.median(data[feature]) rounded_med = round(med, 4) st_dev = statistics.stdev(data[feature]) rounded_st_dev = round(st_dev, 5) return rounded_med, rounded_st_dev for i in range(0, len(features)): (median, st_dev) = find_median_and_SD(features, i) print(f'Feature {i} Median: {median} Standard Deviation: {st_dev}')…arrow_forward
- In 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 80 1 2 3 100 100 100 1001 0 2 100 3 4 100 1002 2 0 4 4 100 5 1003 100 4 0 100 100 4 100100 3 4 100 0 3 3 3100 4 100 100 3 0 100 1100 100 5 4 3 100 0 2100 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 = open(inputfilename, 'r') # Read the number of vertices from the first line of the file n =…arrow_forwardRegex, APIs, BeautifulSoup: python import requests, refrom pprint import pprintfrom bs4 import BeautifulSoup complete the missing bodies of the functions below: def mathmatic(target):"""Question 1You are doing fun math problems. Given a string of combination of '{}', '[]','()', you are required to return the substring included by the outermost '{}'.You need to write your code in one line.Args:target (str): the string to search inReturns:str>>> mathmatic('{[[[[]()]]]}')'[[[[]()]]]'>>> mathmatic('[(){([{}])}]')'([{}])'"""pass test code: # print(mathmatic('{[[[[]()]]]}'))# print(mathmatic('[(){([{}])}]'))arrow_forwardJAVA PROGRAM PLEASE MODIFY THIS PROGRAM and remove Boynames.txt is missing.\n Girlnames.txt is missing.\nBoth data files are missing.\n from this program please. THE TEST CASE DOES NOT ASK FOR IT. PLEASE REMOVE IT. I HAVE PROVIDED THE TEST CASE THAT FAILED AND THE INPUTS AS A SCREENSHOT. import java.io.*;import java.util.*;public class NameSearcher { private static List<String> loadFileToList(String filename) throws FileNotFoundException { List<String> namesList = new ArrayList<>(); File file = new File(filename); if (!file.exists()) { throw new FileNotFoundException(filename); } try (Scanner scanner = new Scanner(file)) { while (scanner.hasNextLine()) { String line = scanner.nextLine().trim(); String[] names = line.split("\\s+"); for (String name : names) { namesList.add(name.toLowerCase()); } } }…arrow_forward
- Write a program that generates a square table that contains randomly generated integer values that are between 0 and10. - include a fixed seed value by using the function random.seedarrow_forward40.|Asiacell docs.google.com/forms :D yuustivi بل اجابة هذا السؤال بشكل PDF Describe the difference between tl .following two progran class Progarml { public static void main(String[] args) { int[] a = {1, 2}: q3(a); System.out.println( a[0]+ " " +a[1]);} class Program2 { public static void main(String[] args) { int[] a = {1, 2}; q3(a[0], a[ 1]); System.out.println(a[0]+ " "+ a[1]);} static void swap(int[] a) { int t = a[0]: a[0] = a[1]: a[1] = t:} static void q3(int n1, int n2) { int t =n1; nl = n2; n2 = t;} إضافة ملف 4 صفحة 3 من التالي Es ل كلمات المرور عبر نماذج Google مطلقًا.arrow_forwardQuestion 10 Create a class that implements a compressed trie for a set of strings. The class should have a constructor that takes a list of strings as an argument, and the class should have a method that tests whether a given string is stored in the trie. JAVA PLZ! . . .arrow_forward
- Write a for loop to print all elements in courseGrades, following each element with a space (including the last). Print forwards, then backwards. End each loop with a newline. Ex: If courseGrades = {7, 9, 11, 10), print: 7 9 11 10 10 11 9 7 Hint: Use two for loops. Second loop starts with i = NUM_VALS - 1. Note: These activities may test code with different test values. This activity will perform two tests, both with a 4-element array (int courseGrades[4]). Also note: If the submitted code tries to access an invalid array element, such as courseGrades[9] for a 4-element array, the test may generate strange results. Or the test may crash and report "Program end never reached", in which case the system doesn't print the test case that caused the reported message. 1 #include HNm in 10 m DO G 2 3 int main(void) { 4 5 6 const int NUM_VALS = 4; int courseGrades [NUM_VALS]; int i; 7 8 for (i = 0; i < NUM_VALS; ++i) { scanf("%d", &(courseGrades[i])); 9 } 10 11 12 13 14 15 } /*Your solution…arrow_forwardProblem Description: Write a telephone lookup program. Read a data set of 1,000 names and telephone numbers from a file that contains the numbers in random order. Handle lookups by name and also reverse lookups by phone number. Use a binary search for both lookups.arrow_forwardComplete the drawTriangle() function in script.js that draws a triangle with asterisks (*) based on the triangleSize parameter. Ex: drawTriangle(4) outputs to the console a triangle with triangleSize 4, so the longest side (4 asterisks) appears on the bottom line: * ** *** **** Hint: Use a loop inside a loop to complete drawTriangle(). The outer loop is responsible for outputting each asterisk line, and the inner loop is responsible for building the asterisk line with the appropriate length by concatenating asterisks to a single string. To test the JavaScript in your web browser, call drawTriangle() from the JavaScript console.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