Best writers. Best papers. Let professionals take care of your academic papers

Order a similar paper and get 15% discount on your first order with us
Use the following coupon "FIRST15"
ORDER NOW

Method A invokes method A itself. This is called _________.

/in /by

Method A invokes method A itself. This is called _________.

Question 1 options:

direct recursion
one-step recursion
indirect recursion
explicit recursion

Save

Question 2What are the base cases in the following recursive method?

public static void recurse(int n)
{
if (n > 0)
{
System.out.print(n % 10);
recurse(n / 10);
}
}

Question 2 options:

n < 0
n <= 0
n > 0
no base cases

Save

Question 3What will be displayed by the method call recurse(1234)?

public static void recurse(int n)
{
if (n <= 0)
{
System.out.print(n % 10);
recurse(n / 10);
}
}

Question 3 options:

Nothing
4 3 2 1
1234
4321

Save

Question 4Analyze the following recursive method and indicate which of the following will be true.

public static long factorial(int n)
{
return n * factorial(n – 1);
}

Question 4 options:

Invoking factorial(2) returns 2.
Invoking factorial(1) returns 1.
Invoking factorial(0) returns 0.
The method runs infinitely and causes a StackOverflowError.

Save

Question 5Fill in the code to complete the following method for computing factorial.

// Return the factorial for a specified index
public static long factorial(int n)
{
if (n == 0)
return 1;
else
return _____________;
}

Question 5 options:

factorial(n – 1) * (n – 1)
n * factorial(n – 1)
n * (n – 1)
n

Save

Question 6What will be displayed by the method call recurse(6)?

public static int recurse(int n)

{

if (n <= 1)

return 1;

else

return n + recurse(n – 2);

}

Question 6 options:

13
14
11
12

Save

Question 7The base case _________ the recursion.

Question 7 options:

pauses
breaks
starts
stops

Save

Question 8What is the output of the following program?

{
public static void main(String[] args)
{
System.out.println(countDown(2, 0));
}
public static int countDown(int n, int result)
{
if (n == 0)
return 0;
else
return countDown(n – 1, n + result);
}
}

Question 8 options:

3
0
2
1

Save

Question 9Which of the following statements about recursive methods is accurate?

Question 9 options:

They must have at least 1 base case and at least 1 recursive case
They must have exactly 1 base case and exactly 1 recursive case
They must have at least 1 base case and exactly 1 recursive case
They must have exactly 1 base case and at least 1 recursive case

Save

Question 10Which of the following is a possible disadvantage of recursion?

Question 10 options:

Recursive solutions tend to have more local variables than their iterative counterparts
Recursive solutions can be less efficient than their iterative counterparts
Recursive solutions tend to be longer than their iterative counterparts
Recursive solutions are more likely to go into infinite loops than their iterative counterparts

Save

Question 11To declare an interface named A with two generic types, use

Question 11 options:

public interface A(E) { … }
public interface A<E, F> { … }
public interface A(E, F) { … }
public interface A<E> { … }

Save

Question 12Will the following code have a runtime error?

Comparable date = new Date();
int i = date.compareTo(“time”);

Question 12 options:

Never
Only when date contains an invalid date
Only when date is not the current date
Always

Save

Question 13To create a list to store integers, use

Question 13 options:

ArrayList<Integer> list = new ArrayList();
ArrayList<Object> list = new ArrayList<Integer>();
ArrayList<Number> list = new ArrayList<Integer>();
ArrayList<int> list = new ArrayList();

Save

Question 14To create a generic type bounded by Number, use

Question 14 options:

<E>
<E extends Integer>
<E extends Object>
<E extends Number>

Save

Question 15Which of the following describes the benefit of using generic classes to implement collections?

Question 15 options:

It eliminates the need to downcast objects when they are inserted into a collection
It eliminates the need to downcast objects when they are removed from a collection
It eliminates the need to upcast objects when they are inserted into a collection
It eliminates the need to upcast objects when they are removed from a collection

Save

Question 16Suppose list list1 is [1, 2, 5] and list list2 is [2, 3, 6]. After list1.addAll(list2), list2 is __________.

Question 16 options:

[1, 2, 2, 3, 5, 6]
[2, 3, 6]
[1, 2, 3, 5, 6]
[1, 5]

Save

Question 17Suppose a list contains {red, red, red, red}. What is the list after the following code?

String element = “red”;
for (int i = list.size() – 1; i >= 0; i–)
if (list.get(i).equals(element))
list.remove(element);

Question 17 options:

[red, red, red]
[red, red]
[]
[red]

Save

Question 18Which of the following is correct to sort the elements in a list aList?

Question 18 options:

Collections.sort(aList)
Arrays.sort(aList)
new LinkedList<String>(new String[]{red, green, blue})
aList.sort()

Save

Question 19Which of the following best describes all objects of type List?

Question 19 options:

They define an unordered collection that allows duplicates
They define an ordered collection that allows duplicates
They define an unordered collection that prohibits duplicates
They define an ordered collection that prohibits duplicates

Save

Question 20Which of the following problems would be a good candidate for using a stack?

Question 20 options:

A task scheduler that schedules tasks in the order that they are received
A print spooler that dispatches jobs based on shortest job first
A program that is designed to evaluate expressions
An inventory system that processes product records by product number
 
Looking for a Similar Assignment? Order now and Get 10% Discount! Use Coupon Code "Newclient"