Mean and standard deviation. Write a
However, this formula is not suitable for the task. By the time the program has computed
You can compute this quantity by keeping track of the count, the sum, and the sum of squares as you process the input values.
Want to see the full answer?
Check out a sample textbook solutionChapter 4 Solutions
Big Java Late Objects
Additional Engineering Textbook Solutions
Starting Out with Java: From Control Structures through Objects (6th Edition)
Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
Starting Out with Programming Logic and Design (5th Edition) (What's New in Computer Science)
Database Concepts (7th Edition)
Starting Out with Java: From Control Structures through Data Structures (3rd Edition)
Software Engineering (10th Edition)
- Write a program that reads two integer matrices and performs multiplication. Also, print the output matrix. The size of the matrices are to be taken from the user.arrow_forwardWrite a program that accepts a set of integer numbers. Your program should count the number of even numbers and find the maximum even. Use -1 to stop your data entry. Sample Input/ Output: Enter integer numbers, Use -1 to stop your data entry. 12 33 66 -1 There are 2 even numbers. The maximum even number is 66.arrow_forwardcode in java pls Summary: Given integer values for red, green, and blue, subtract the gray from each value. Computers represent color by combining the sub-colors red, green, and blue (rgb). Each sub-color's value can range from 0 to 255. Thus (255, 0, 0) is bright red, (130, 0, 130) is a medium purple, (0, 0, 0) is black, (255, 255, 255) is white, and (40, 40, 40) is a dark gray. (130, 50, 130) is a faded purple, due to the (50, 50, 50) gray part. (In other words, equal amounts of red, green, blue yield gray). Given values for red, green, and blue, remove the gray part. Ex: If the input is: 130 50 130 the output is: 80 0 80 Find the smallest value, and then subtract it from all three values, thus removing the gray.arrow_forward
- System.out.println (x); for (int i - 0; i < x.length System.out.println (x); for (int i = 1; i < x.lengh; i++) System.out.println (x[i]); for (int i -0; i < x.length; i++) System.out.println (x[i]); None of the above 3. int [] x new int[6]; To print all array elements we use: a. b. 1; i++) C. d. e.arrow_forwardProblem 2: Postman Harry Harry is a postman. He's got a post office with a size of n rows and m columns. Each slot at the post office contains a number of letters. Harry can only go right and down. He starts at (0, 0), and ends at (n-1, m-1). Write a program that calculates the maximum amount of letters Harry can pick up. He can only pick up letters from a slot if he is on that slot. If the amount of letters is the same down and right, go right. Sample input/output: Enter the number of rows and columns: 35 Enter the number of letters in the 5 slots of row number 1: 5 2 60 1 Enter the number of letters in the 5 slots of row number 2: 2 4 3 9 2 Enter the number of letters in the 5 slots of row number 3: 8 72 3 4 The maximum number of letters Harry can pick is 32 solve using c++; (chapter 9: Variables / Assignments)arrow_forwardWrite a program that reads a list of integers from input into an array and outputs "yes" if the list is sorted in ascending order between two provided positions. Otherwise, output "no". The first input specifies the number of items in the list. The next set of inputs is the list. The last two inputs are the start and end positions (inclusive). Assume the list contains less than 20 integers and position 1 is the first element. Ex: If the input is: 8 5 6 7 4 3 2 1 0 1 3 the output is: yes Ex: If the input is: 6 1 2 3 4 5 2 4 6 the output is: noarrow_forward
- The Fibonacci sequence begins with 0 and then 1 follows. All subsequent values are the sum of the previous two, for example: 0, 1, 1, 2, 3, 5, 8, 13. Complete the fibonacci() function, which takes in an index, n, and returns the nth value in the sequence. Any negative index values should return -1 Ex: If the input is: 7 the output is: fibonacci (7) is l3 Note: Use recursion and DO NOT use any loops.arrow_forwardGiven an integer N and a base X, the task is to find the minimum number of operations required to represent N as a sum of the distinct powers of X. In each operation, you can either increment or decrement N. You are allowed to make the given operation any number of times Examples: Input: N = 7, X = 3 Output: 3.arrow_forwardWrite a program that calculates the equivalent resistance of a circuit. n electrical resistors with resistance values R1, R2,.., Rn are said to be connected in parallel if the same voltage is applied across each. Their equivalent resistance Reg is related to the values R1, R2, ..., Rn by: 1 1 1 1 + +...+ R R R, R. "eq Write a program that prompts the user to enter the resistance of n resistors. The user should be prompted continuously by using a while loop until a zero or negative value is entered (the program should count the number of resistors n entered by the user and store the values in an array). Use another separate loop to print the resistance values entered by the user and the equivalent resistance Reg. Test your program with R1= 1 kn, R2= 2 kn, R3= 4 kQ and R4= 8 kQ.arrow_forward
- In JAVA code (Insertion Sort): 1. Prepare a data set containing 10,000 integers (random). 2. Make a code that will create 3 variants of the data: one in best case (data are arranged in ascending order); the other in worst case (data are arranged in descending order); and the last in average case (data are randomly arranged). 3. Each integer is considered as one input in the code. 4. The output of your program should be the number of statements executed in the process of sorting for each of the algorithms. This, therefore, means that you have to embed a counter variable in your program that keeps track of the number of statements executed in the sorting part of your code. 5. The end value of the variable shall be the output of your program.arrow_forwardIn JAVA code (Insertion Sort): 1. Prepare a data set containing 10,000 integers (random). 2. Make a code that will create 3 variants of the data: one in best case (data are arranged in ascending order); the other in worst case (data are arranged in descending order); and the last in average case (data are randomly arranged). 3. Each integer is considered as one input in the code. 4. The output of your program should be the number of statements executed in the process of sorting for each of the algorithms. This, therefore, means that you have to embed a counter variable in your program that keeps track of the number of statements executed in the sorting part of your code. 5. The end value of the variable shall be the output of your program. Below is a sample of the code in Bubble Sort; I am asking for the program for insertion sort.arrow_forwardWrite a program that takes 10 random numbers from 1 to 12 inclusively and averages them together.arrow_forward
- 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