Unit 10 Test Review

The case when the method calls itself

• recursive method

• call stack

• base case

• iterative statement

The stack of calls to methods

• recursive method

• call stack

• base case

• iterative statement

use of the divide and conquer approach to arrange array elements

• base case

• merge sort

• indirect recursion

• void recursive method

code sequence that stops the recursion process

• base case

• merge sort

• head recursion

• tall recursion

What will happen when the following code is executed in a Java program?

void myMethod() {

myMethod(); }

int main() {

myMethod();

return 0; }

• The code will run for some time and stop abruptly.

•  The code will show a compile-time error.

• The code will display 0 on the screen.

• The code will generate random output.

• The code will execute, but no output will be generated.

In which of the following do you divide the array into halves using a recursive technique?

I. searching a value in an array

II. finding the sum of natural numbers

III. arranging array elements

Practice

• I only

• II only

• III only

• I and II

• I and III

Which of the following give(s) a disadvantage of a recursive method compared with an iterative method?

I. extra memory space

II. small code size

III. more execution time

• I only

• II only

• III only

• I and II

• I and III

Which of the following cannot be solved using recursion?

I. code with nested iteration

II. code with nested if-else

III. code without a base case

• I only

• II only

• III only

• I and II

• II and III

static void print(int x){

if(x==0) return;

System.out.print(x%2); print(x/2); }

What will be the output of the above code segment if the print() method is called with the parameter 9?

• 001

• 100

• 1001

• 101

• 1110

static int doSomething(int a, int b){

if(b==1)

return a; else{

return a+ doSomething(a, b-1); }

What will be the output of the doSomething() method if a = 5 and b = 6?

• StackOverFlowException

• 5

• 1

• 30

• 6