Write a method named size that takes one int[]00 parameter (array of arrays). The method should return a single number showing the total number of elements in the array. Do not make any of array assumptions about regularity of the array. This means the array may have different number of arrays in each of its rows. If the following array is passed to your method, the output should be 27, as it has 27 elements in total. double [] [] 1 scores %D {{7.5, 20.5}, (9.0, 22.5), (15, 33.5), {13, 21.5}, (15, 2.5}}, {(4.5, 21. 5), (9.0, 22.5), (15,, 34.5), (12, 20.5), (14, 9.5)), {{30.5), ( 9.4, 10.5), (11, 33.5), (11, 23.5}},

Write a method named size that takes one int[]00 parameter (array of arrays). The method should return a single number showing the total number of elements in the array. Do not make any of array assumptions about regularity of the array. This means the array may have different number of arrays in each of its rows. If the following array is passed to your method, the output should be 27, as it has 27 elements in total. double [] [] 1 scores %D {{7.5, 20.5}, (9.0, 22.5), (15, 33.5), {13, 21.5}, (15, 2.5}}, {(4.5, 21. 5), (9.0, 22.5), (15,, 34.5), (12, 20.5), (14, 9.5)), {{30.5), ( 9.4, 10.5), (11, 33.5), (11, 23.5}},

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Write a static method: public static double intersectionSum(double[] a, double[] b) that takes two double arrays as arguments and returns the sum of the elements the two arrays have in common. In other words, the result should be the sum of every element in the two arrays where a[i] is equal to b[i] for some index i. Note that the two arrays may not be the same length. In these cases, you should only consider the indices that the arrays have in common (the indices of the shorter array). If either (or both) arrays are empty or null, the result should be 0.0. Example 1: intersectionSum({3.0, -4.0, 5.8, 6.75}, {3.0, 2.5, 5.8, 4.95}) è 8.8, since a[0] == b[0] and a[2] == b[2] and 3.0 + 5.8 = 8.8 Example 2: intersectionSum({8.5, 9.75, 1.25}, {3.5, 9.75, 1.25, 8.5, -2.34}) è11.0, since a[1] == b[1] and a[2] == b[2] and 9.75 + 1.25 = 11.0
Write a void method selectionSortDescendTrace() that takes an integer array, and sorts the array into descending order. The method should use nested loops and output the array after each iteration of the outer loop, thus outputting the array N-1 times (where N is the size). Complete main() to read in a list of up to 10 positive integers (ending in -1) and then call the selectionSortDescendTrace() method. If the input is: 20 10 30 40 -1 then the output is: 40 10 30 20 40 30 10 20 40 30 20 10
You will notice that a class named PeriodicTable has been provided to you. Inside the class is a static, two-dimensional arrayof strings named ELEMENTS that contains information about every element in theperiodic table, so: ELEMENTS[0] is { "1", "Hydrogen", "H", "1.007" }; ELEMENTS[1] is { "2", "Helium", "He", "4.002" } and so on ... Add a static method to this class that uses the array to build a datastructure of elements such that it is fast and easy to find an element usingonly its symbol. Your method should match the following signature, but replaceDataStructure with your chosen data structure. public static DataStructure makeFastPeriodicTable() {} Hint: you can use the Integer.parseInt("2") and Double.parseDouble("1.23")methods to create numeric values from strings. _____________________________________________________ public class PeriodicTable {public static final String[][] ELEMENTS = {{ "1", "Hydrogen", "H", "1.007" },{ "2", "Helium", "He", "4.002" },{ "3", "Lithium",…
Method #2: Write a method named longestSortedSequence that accepts an array of integers as a parameter and that returns the length of the longest sorted (nondecreasing) sequence of integers in the array. For example, if a variable named array stores the following values: int[] array = {3, 8, 10, 1, 9, 14, -3, 0, 14, 207, 56, 98, 12}; then the call of longestSortedSequence(array) should return 4 because the longest sorted sequence in the array has four values in it (the sequence -3, 0, 14, 207). Notice that sorted means nondecreasing, which means that the sequence could contain duplicates. For example, if the array stores the following values: int[] array2 = {17, 42, 3, 5, 5, 5, 8, 2, 4, 6, 1, 19} Then the method would return 5 for the length of the longest sequence (the sequence 3, 5, 5, 5, 8). Your method should return 0 if passed an empty array. - Your code should have two classes ( Drive , Methods ) - Methods class should include longestSortedSequence(array) and swapPairs(array)…
Write a method reverse that takes an array as an argument and returns a new array with the elements in reversed order. Do not modify the array. Only edit code in the /* Your code code goes here */ portions.
Write a method called kthLargest() that accepts an integer x and an array a of integers as its parameters. It should then return the elements that that k elements of greater or equal value. So if k = 0 return the largest element. If k = 1. return the second-largest element, and so on. Do not change the array itself, but you can make a copy if you want. Suggested approach make a COPY of the array. Sort the copy then find the kth element of the copy and return it. The original is left untouched! :) For example if array1 = {74, 85, 102, 99, 101, 56, 84} and the function kthLargest(2, array1) is called, then your method should return 99 because there are two values that are larger than 99. (101 and 102). If x is less than zero or greater than/equal to the the size of the array then return -9999; Make sure your main function works for the following public static void main(String[] args){int[] array1 = {6, 8, 2, 3, 5, 12, 16, 1, 7, 4, 21, 19};int answer =…
Write the method sum2D() which accepts a two dimensional integer array and returns the sum of all the elements of the array.
I need to write an array that can remove the middle element of an array if the array is odd length and remove the middle 2 elements if the array is of even length. my current method looks like this but does not work. Where am I going wrong? public static int[] removeMiddle(int[] values) { boolean even = false; int temp = values[0]; int temp2 = values[0]; int count = values.length; if( count % 2 == 0){ even = true; } for (int i = 1; i < values.length-1; i++){ if (even = true){ temp = values.length / 2; temp2 = values.length / 2 + 1; }else if(even = false){ temp = values.length / 2; values[temp] = values.length-1; count--; } } The problem is from Big Java 6th Edition. E7.10
Define an array to be a 121 array if all elements are either 1 or 2 and it begins with one or more 1s followed by a one or more 2s and then ends with the same number of 1s that it begins with. Write a method named is121Array that returns 1 if its array argument is a 121 array, otherwise, it returns 0. There is one additional requirement. You should return 0 as soon as it is known that the array is not a 121 array; continuing to analyze the array would be a waste of CPU cycles. If you are programming in Java or C#, the function signature isint is121Array(int[ ] a) If you are programming in C or C++, the function signature isint is121Array(int a[ ], int len) where len is the number of elements in the array a. Examples a is then function returns reason {1, 2, 1} 1 because the same number of 1s are at the beginning and end of the array and there is at least one 2 in between them. {1, 1, 2, 2, 2, 1, 1} 1 because the same number of 1s are at the beginning and end of…
Write the method printTail() method that accepts an array of integers and an integer index as parameters and prints all the array elements starting from the index passed. For example if printTail(x,5) is invoked, it should print all the elements of the array x starting at x[5].
Write a static method called runningSum that accepts an array parameter, populated with a sequence of real numbers that are read from a file. The program outputs the running sum of the numbers followed by the maximum running sum. For example, if the array contains the following data: 3.25 4.5 -8.25 7.25 3.5 4.25 -6.5 5.25 your method should produce the following output: running sum = 3.25 7.75 -0.5 6.75 10.25 14.5 8.0 13.25 max sum = 14.5
Write a static method called runningSum that accepts an array parameter, populated with a sequence of real numbers that are read from a file. The program outputs the running sum of the numbers followed by the maximum running sum. For example, if the array contains the following data: 3.25 4.5 -8.25 7.25 3.5 4.25 -6.5 5.25 your method should produce the following output:running sum = 3.25 7.75 -0.5 6.75 10.25 14.5 8.0 13.25max sum = 14.5 CODE is javascript only