When does quicksort’s worst-case run-time behavior occur? I    when the data is randomly initialized in the array II   when the data is in ascending order III  when the data is in descending order

Assume we are using quicksort to sort an array in ascending order. What can we conclude about the indexes of two pivot elements placed in consecutive recursive calls?

A ________ is a user-interface component with two states: checked and unchecked.

A ________ is a user-interface component with two states: checked and unchecked.

Under which condition will the Scanner constructor generate a FileNotFoundException?

What is required to make a recursive method successful? I  special cases that handle the simplest computations directly II a recursive call to simplify the computation III a mutual recursion

Consider the Counter class below. public class Counter { public int count = 0; public int getCount() { return count; } public void increment() { count++; } } Using the class above and the variables declared below, what is the value of num1.equals(num2)? Counter num1 = new Counter(); Counter num2 = new Counter();

Consider the square method shown below that takes a non-negative int argument: public int square(int n) { return squareHelper(n, n); } public int squareHelper(int c, int n) { if (c == 1) { return n; } else { return n + squareHelper(c – 1, n); } } Assume that the last return statement in the squareHelper method is changed to this: return squareHelper(c – 1, n); What would a call to square(7) return?

To ensure that an instance variable can only be accessed by the class that declared it, how should the variable be declared?

Given the following code snippet for searching an array: int[] arr = {3, 8, 12, 14, 17}; int newVal = 15; int pos = Arrays.binarySearch(arr, newVal); What value will pos have when this code is executed?