java六章.doc

java第六章 1. The arraycopy method does not allocate memory space for the target array. The target array must already be created with memory space allocated. a. false b. true # 2. What is the output of the following code? double[] myList = {1, 5, 5, 5, 5, 1}; double max = myList[0]; int indexOfMax = 0; for (int i = 1; i myList.length; i++) { if (myList[i] = max) { max = myList[i]; indexOfMax = i; } } System.out.println(indexOfMax); a. 4 b. 0 c. 1 d. 2 e. 3 # 3. How many elements are in array double[] list = new double[5]? a. 5 b. 4 c. 0 d. 6 # 4. Show the output of the following code: public class Test { public static void main(String[] args) { int[] x = {1, 2, 3, 4, 5}; increase(x); int[] y = {1, 2, 3, 4, 5}; increase(y[0]); System.out.println(x[0] + + y[0]); } public static void increase(int[] x) { for (int i = 0; i x.length; i++) x[i]++; } public static void increase(int y) { y++; } } a. 2 2 b. 0 0 c. 1 2 d. 1 1 e. 2 1 # 5. The array index of the first element in an array is 0. a. false b. true # 6. Analyze the following code: public class Test { public static void main(String[] args) { final int[] x = {1, 2, 3, 4}; int[] y = x; x = new int[2]; for (int i = 0; i y.length; i++) System.out.print(y[i] + ); } } a. The program displays 1 2 3 4 b. The program displays 0 0 c. The program has a compile error on the statement x = new int[2], because x is final and cannot be changed. d. The elements in the array x cannot be changed, because x is final. # 7. If a key is not in the list, the binarySearch method returns _________. a. insertion point b. -insertion point c. -(insertion point + 1) d. insertion point - 1 # 8. Assume int[] scores = {1, 20, 30, 40, 50}, what value does java.util.Arrays.binarySearch(scores, 3) return? a. -2 b. 1 c. 0 d. 2 e.