Consider the mode method, which is intended to return the mo…

Consider the mode method, which is intended to return the most frequently occurring value (mode) in its int[] parameter arr. For example, if the parameter of the mode method has the contents {6, 5, 1, 5, 2, 6, 5}, then the method is intended to return 5. /** Precondition: arr.length >= 1 */ public static int mode(int[] arr) { int modeCount = 1; int mode = arr[0];   for (int j = 0; j < arr.length; j++) { int valCount = 0; for (int k = 0; k < arr.length; k++) { if ( /* missing condition 1 */ ) { valCount++; } } if ( /* missing condition 2 */ ) { modeCount = valCount; mode = arr[j]; } } return mode; } Which of the following can replace /* missing condition 1 */ and /* missing condition 2 */ so the code segment works as intended? A /* missing condition 1 */ /* missing condition 2 */ arr[j] == arr[k] valCount > modeCount B /* missing condition 1 */ /* missing condition 2 */ arr[j] == arr[k] modeCount > valCount C /* missing condition 1 */ /* missing condition 2 */ arr[j] != arr[k] valCount > modeCount D /* missing condition 1 */ /* missing condition 2 */ arr[j] != arr[k] modeCount > valCount E /* missing condition 1 */ /* missing condition 2 */ arr[j] != arr[k] modeCount != valCount  

The code segment below is intended to print the length of th…

The code segment below is intended to print the length of the shortest string in the array wordArray. Assume that wordArray contains at least one element. int shortest = /* missing value */; for (String word : wordArray) { if (word.length() < shortest) { shortest = word.length(); } } System.out.println(shortest); Which of the following should be used as the initial value assigned to shortest so that the code segment works as intended?

Consider the following method, which is intended to return t…

Consider the following method, which is intended to return the number of local maximum values in an array. Local maximum values are array elements that are greater than both adjacent array elements. The first and last elements of an array have only a single adjacent element, so neither the first nor the last array element is counted by this method. For example, an array containing the values {3, 9, 7, 4, 10, 12, 3, 8} has two local maximum values: 9 and 12. public static int countPeaks(int[] data) { int numPeaks = 0;   for ( /* missing loop header */ ) { if (data[p – 1] < data[p] && data[p] > data[p + 1]) { numPeaks++; } } return numPeaks; } Which of the following can replace /* missing loop header */ so the method countPeaks works as intended?

Consider the problem of finding the maximum value in an arra…

Consider the problem of finding the maximum value in an array of integers. The following code segments are proposed solutions to the problem. Assume that the variable arr has been defined as an array of int values and has been initialized with one or more values. Which of the code segments will always correctly assign the maximum element of the array to the variable max ?