What type of algorithm places elements in order?

Using the following definitions of the Measurable and Named interfaces. public interface Measurable { double getMeasure(); } public interface Named { double getName(); } Assume BankAccount provides the code for the getMeasure() and getName() methods. Which of the following could correctly represent the class header for BankAccount?

 Consider the hierarchy of classes shown below. What is the superclass of the class TelevisionShow?

Complete the following code snippet, which is intended to be a recursive method that will find the sum of all elements in an array of double values from the beginning of the array to index: // return the sum of all elements in arr, int index) { if (index == 0) { _____________________ } else { return (arr + findSum(arr, index – 1)); } } Assume that this method would be called using an existing array named myArray as follows: findSum(myArray,myArray.length – 1);

Consider the following code snippet: public interface Sizable { int LARGE_CHANGE = 100; int SMALL_CHANGE = 20; void changeSize(); } Which of the following statements is true?

Consider the following code snippet: public static boolean isEven(int n) { if (n % 2 == 0) { return true; } else { return (isOdd(n)); } } public static boolean isOdd(int n) { if (n % 2 == 1) { return true; } else { return (isEven(n)); } } For any given value of n, what is the maximum number of function calls that could occur, including the original call?

The Comparable interface consists of a single method called ____.

Complete the following code snippet, which is intended to be a recursive method that will find the sum of all elements in an array of double values from the beginning of the array to index: // return the sum of all elements in arr, int index) { if (index == 0) { _____________________ } else { return (arr + findSum(arr, index – 1)); } } Assume that this method would be called using an existing array named myArray as follows: findSum(myArray,myArray.length – 1);

A search technique where, in each step, you split the size of the search in half is called a____ search.

Consider the permutations method from the textbook, which is intended to return all permutations of the word passed in as a parameter. What special cases for the simplest values are used by the permutations method to terminate the recursion? public static ArrayList permutations(String word) { ArrayList result = new ArrayList(); if (word.length() == 0) // line #1 { result.add(word); // line #2 return result; // line #3 } else { for (int i = 0; i < word.length(); i++) // line #4 { String shorter = word.substring(0, i) + word(substring(i + 1); // line #5 ArrayList shorterPermutations = permutations(shorter); // line #6 for (String s : shorterPermutations) // line #7 { result.add(word.charAt(i) + s); // line #8 } } return result; // line #9 } }