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?

Which class represents a more specific entity in an inheritance hierarchy?

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?

How many times can an array with 4,096 elements be cut into two equal pieces?

What is the default layout manager of the content pane of a JFrame?

Select an appropriate expression to complete the following code segment, which is designed to print a message if the string stored in name is the first element of the players linked list. LinkedList players = new LinkedList(); // code to add elements to the linked list if ______________________________________ { System.out.print(name + ” is the first player on the list.”); }

In general, the expression ____ means that f grows no faster than g.