Blog

What type of algorithm places elements in order?

You use a(n) ____ to access elements inside a linked list.

Complete the code shown to define the Comparator interface for comparing Auto objects. ___________________________ { int compare(Auto a, Auto b); }

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[] public static double findSum(double arr[], int index) { if (index == 0) { _____________________ } else { return (arr[index] + 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: Scanner in = new Scanner(. . .); in.useDelimiter(“[^0-9]+”); What characters will be ignored and not read in using this code?

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

Which of the following GUI objects generate(s) action events? I JComboBox II JRadioButton III JButton

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

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[] public static double findSum(double arr[], int index) { if (index == 0) { _____________________ } else { return (arr[index] + 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 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 } }