If a call to the Arrays static method binarySearch returns a value of -10, what can be concluded? I     the element is not in the array II    the element is at index 10 III   the element can be inserted at index 9

Consider the code for the recursive method printSum shown in this code snippet, which is intended to return the sum of digits from 1 to n: public static int printSum(int n) { if (n

The largestPosition method below returns the index of the largest element in the tail range of an array of integers.  Select the expression that would be needed to complete the selectionSort method below, so that it sorts the elements in descending order. /** Finds the largest element in the tail range of an array. @param a the array to be searched @param from the first position in a to compare @return the position of the largest element in range a[from]..a[a.length – 1] */ private static int largestPosition(int[] a, int from) { int maxPos = from; for(int j = from + 1; j < a.length; j++) { if (a[j] > a[maxPos]) { maxPos = j; } } return maxPos; } public static void selectionSort(int[] a) { for____________________________________ { int maxPos = largestPosition(a, i); ArrayUtil.swap(a, maxPos, i); } }

Which of the following statements about events and graphical user interface programs is true?

A list is a collection that ____.

Which of the following statements about inheritance is correct?

Insert the missing code in the following code fragment. This fragment is intended to read characters from a text file. Scanner in = new Scanner(. . .); in.useDelimiter(“”); while (in.hasNext()) { char ch = ____________; System.out.println(ch); }

Consider the following code snippet: class MouseClickedListener implements ActionListener { public void mouseClicked(MouseEvent event) { int x = event.getX(); int y = event.getY(); component.moveTo(x,y); } } What is wrong with this code?

All rodents are mammals and all canines are mammals.  No canines are rodents and no rodents are canines.  What hierarchy best captures this information?

Which problem-solving technique examines partial solutions, abandons unsuitable ones, and returns to consider other candidate solutions.