double[][] studentGrade={{10,20,0},{20,40,0}}; A method called computeAvg will take this 2-D array studentGrade as the parameter, compute the average of 1st and 2nd columns and put the average at the 3rd column for each row. Then it should print the values of the resulting 2-D array. The array should be printed in the form of a matrix. In your main method, call the computeAvg method.

double[][] studentGrade={{10,20,0},{20,40,0}}; A method called computeAvg will take this 2-D array studentGrade as the parameter, compute the average of 1st and 2nd columns and put the average at the 3rd column for each row. Then it should print the values of the resulting 2-D array. The array should be printed in the form of a matrix. In your main method, call the computeAvg method.

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter9: Advanced Modularization Techniques

Section: Chapter Questions

Problem 2GZ

See similar textbooks

Similar questions

Write the method sum2D() which accepts a two dimensional integer array and returns the sum of all the elements of the array.
An element in the array is a peak (max or min) if the elements before and after that element are greater than the element itself (min) or the elements before and after that element are less than the element (max). Write a method in your program called displayPeaks that will take a single-dimensional array as parameter and display all peak elements of that array (line by line) together with their index and whether they are max or min. For example, calling the method displayPeaks from main method will display: 83 at position 0 is a max 48 at position 1 is a min 89 at position 2 is a max 40 at position 4 is a min 94 at position 5 is a max 12 at position 8 is a min 87 at position 11 is a max 10 at position 12 is a min 78 at position 14 is a max 2 at position 15 is a min 52 at position 18 is a max 46 at position 19 is a min
Please add comments on each line Thank you very much Suppose you have two arrays of ints, arr1 and arr2, each containing ints that are sorted in ascending order. Write a static method named merge that receives these two arrays as parameters and returns a reference to a new, sorted array of ints that is the result of merging the contents of the two arrays, arr1 and arr2. Note: you do not need to (and should not) sort here. Think of having two sorted piles of cards, that you're combining (merging) into another pile. You keep putting cards into the new pile, sometimes taking from one of your original piles, sometimes taking from the other.
Instrument shellsort to print the number of compares divided by the array sizefor each increment. Write a test client that tests the hypothesis that this number is asmall constant, by sorting arrays of random Double values, using array sizes that areincreasing powers of 10, starting at 100
Can you fix my code? I am still having 1 senators as it should be 2 because there are 2 senator position on the array. I think its the loop I am wrong thank you <body> <?php $candidates = [ ['name' => 'Allan', 'position' => 'President'], ['name' => 'Rhea', 'position' => 'Vice President'], ['name' => 'Jane', 'position' => 'Senator'], ['name' => 'Jfafa', 'position' => 'Senator'], ]; $counterPresident = 0; $counterVicePresident = 0; $counterSenator = 0; switch($candidates as $p) { case "1" ($p['position'] == "President") { ++$counterPresident; } else if($p['position'] == "Vice President") { ++$counterVicePresident; } else if($p['position'] == "Senator") { ++$counterSenator; } } echo "Presidents: ". $counterPresident ." candidates"; echo "<br>"; echo "Vice President: ". $counterVicePresident ." candidates"; echo…
You will write three methods in this questions. The first method calledinputGetter will check the input if it is a positive integer. It will ask for a new input until theuser enters a positive integer and returns the valid integer N. Then, this integer N will beutilized as a parameter for the second method called primeFactorization. This method will getthe number N and returns a two-dimensional array that shows the prime factors and howmany times each factor exists in this number. The first element of the array will be the primefactor, the second element will show how many times this factor exists. Then, the last methodprint will get this array and prints all elements as exactly as it is shown in the output exampleruns.
A method named duplicatesCount that takes an array of double values and returns the count of numbers duplicated (i.e. numbers that appear more than once) in the array, regardless of how many times each is duplicated. For example, if the array {1.1, 9.9, 4.4, 3.3, 3.3, 9.9, 2.2, 6.6, 7.7, 1.1, 9.9} is passed to this method, it must return 3 since the numbers 1.1, 9.9, and 3.3 appear more than once in the array. 2. A method named commonCount that takes two arrays of double values and returns the count of numbers that are common between the two arrays. If an element appears more than once it must not be counted twice. For example, if the arrays {1.1, 3.3, 4.4, 6.6, 1.1, 5.5, 3.3, 6.6} and {5.5, 9.9, 6.6, 8.8, 7.7, 9.9, 5.5) are passed to this method, it must return 2 since the numbers 6.6 and 5.5 are common between the two arrays. 3. A method named overlap that takes two arrays of double values and returns a new array that contains the concatenation of them…
Please use the information on the first screenshot about a class BST and node class to implement a method named “randomArray” in the file named “BSTTest.java” that tests a specific sorting algorithm. This method will take one parameter: size of a randomly generated array (int): e.g., 10 This method will: Generate and return a random array of the length specified by the parameter The value range of each element should be between 0 and 1000 (inclusive) >>> randomArray(5). >>> [1, 2, 3, 7, 10] Implement a method named “test” in the file named “BSTTest.java”. This method should take advantage of the implemented randomArray and print out information as such: Testing of BST starts. Insert 3 Insert 2 Insert 5 Insert 100 Delete 3. The traverse gives a BST as 3, 5, 100 Testing of BST ends. Please note that the goal is not to manually code the printings of each line. Try your best to make this method as automatic as possible. There are no limits on what parameters this…
Consider the following incomplete code for generateMatrix method. Assume that the initializeArray method that is invoked by generateMatrix assigns 0 to every cell of the array that is passed to it. Suppose the expression generateMatrix(5) will return an array of the following form: a. row > (size - 1) && col > size - 1b. row > (size - 1) || col > size - 1c. row < (size - 1) && col > size - 1d. row > (size - 1) && col < size - 1e. row > size && col > size
The editTemperatures() method takes in two parameters: integer array tempData and integer numMore. Complete editTemperatures() to create a new array called arrayCopy with the same elements as tempData, and the size increased by numMore. Ex: If the input is: 10 48 49 18 3 then the output is: 10 48 49 18 0 0 0 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 Scannerscnr=newScanner(System.in); int[] degreesFahrenheit=newint[4]; intinput; inti; for (i=0; i<degreesFahrenheit.length; ++i) { degreesFahrenheit[i] =scnr.nextInt(); } // Read number of values to increase array size by input=scnr.nextInt(); degreesFahrenheit=editTemperatures(degreesFahrenheit, input); for (i=0; i<degreesFahrenheit.length; ++i) { System.out.print(degreesFahrenheit[i] +" "); } } }
In java, please read the text file as array. Then, replace the null with 0 and calculate the sum of the new students in ABC University.Example of text file: (university,year,total_students,new_students,new_staff,ABC, 2000, 3457, , ,ABC, 2001, 3675,218, ,EFG, 2000, 2389,602, ,EFG, 2001, 2785,396, 65,)
# the method take another circular array and returns a linear array containing the common elements between the two circular arrays. def intersection(self, c2): # To Do print("==========Test 10==========") lin_arr9 = [10, 20, 30, 40, 50, None, None, None] c10 = CircularArray(lin_arr9, 5, 5) c10.printFullLinear() # This should print: 40, 50, None, None, None, 10, 20, 30 lin_arr10 = [5, 40, 15, 25, 10, 20, 5, None, None, None, None, None] c11 = CircularArray(lin_arr10, 8, 7) c11.printFullLinear() # This should print: 10, 20, 5, None, None, None, None, None, 5, 40, 15, 25 output = c10.intersection(c11) print(output) # This should print: [10, 20, 40]