If an element is present in an array of length n, how many element visits, in the worst case, are necessary to find it using a linear search?

Consider the method below, which displays the characters from a String in reverse order.  Each character appears on a separate line.  Select the statement that should be used to complete the method so that it performs a recursive method call correctly. public static void printReverse(String word) { if (word.length() > 0) { ___________________________ System.out.println(word.charAt(0)); } }

Which of the following objects should be used for reading from a text file?

Which of the following classes have a user-editable area?

You need to access values by an integer position.  Which collection type should you use?

Complete the code shown to define the Comparator interface for comparing Auto objects. public interface Comparator { _____________________ }

A palindrome is a word or phrase that reads the same forward or backward. Consider the following code snippet: public boolean palindrome(String string) { return isPal(string, 0, string.length() – 1); } private boolean isPal(String string, int left, int right) { if (left >= right) { return true; } else if (string.charAt(left) == string.charAt(right)) { return isPal(string, left + 1, right – 1); } else { return false; } } What is the purpose of the palindrome method?

Consider the following code snippet: Vehicle aVehicle = new Auto(); aVehicle.moveForward(200); If the Auto class inherits from the Vehicle class, and both classes have an implementation of the moveForward method with the same set of parameters and the same return type, which statement is correct?

If the user wants to process keystrokes, which methods of the KeyListener interface must be implemented?

A portion of your program includes the loops shown in the code snippet below to examine the elements of two arrays, arr1 and arr2, both of length n: int matches = 0; for (int i = 0; i < arr1.length; i++) { for (int j = 0; j < arr2.length; j++) { if (arr1[i].equals(arr2[j])) { matches++; } } } What can you conclude about the running time of this section of code?