In recursion, the recursive call is analogous to a loop ____.

Which of the following statements about the try/finally statement is NOT true?

Complete the following code snippet, which is intended to determine if a value is even or odd using mutual recursion: public static boolean isEven(int n) { if (n == 0) { return true; } else { return isOdd(Math.abs(n) – 1); } } public static boolean isOdd(int n) { if (n == 0) { _________ } else { return isEven(Math.abs(n) – 1); } }

Which of the following statements about the try/finally statement is NOT true?

Assuming that the ClickListener class implements the ActionListener interface, what statement should be used to complete the following code segment? ClickListener listener = new ClickListener(); JButton myButton = new JButton(“Submit”); JPanel myPanel = new JPanel(); myPanel.add(myButton); ______________________ //missing statement

Suppose you push integer elements 1,2,3,4 onto a stack in that order. Then pop an element off the stack and add that element to a queue. You repeat that process three more times. In what order will you remove the elements from the queue?

Selection sort has O(n2) complexity. If a computer can sort 1,000 elements in 4 seconds, approximately how many seconds will it take the computer to sort 1,000 times that many, or 1,000,000 elements?

What is the preferred way to implement event listeners?

Another name for linear search is ____ search.

Which of the following statements about white space in Java is correct?