Question 1

Look at the following pseudocode algorithm. algorithm Test14(int x)
If (x < 8)
Return (2 * x)
Else
Return (3 * Test14(x - 8)+ 8)
End Test14
What value is returned for Test14(7)?
A) 0
B) 7
C) 14
D) -5

Accepted Answer

Since 7 < 8, the algorithm simply returns the value of 2 times 7, which is 14.

Question 2

Look at the following pseudocode algorithm. Algorithm Test3(int a,int b)
If (a < b)
Return 5
Else if ( a == b)
Return -5;
Else
Return (a + Test3(a - 1,b)
End Test3
What is the base case for the algorithm?
A) a < b
B) a == b
C) Both a and b
D) Neither a or b

Accepted Answer

The base case is when a == b, as this is the only condition that will stop the recursion.

Question 3

Look at the following method. public static int test2(int x,int y)
{
If ( x < y)
{
Return -5;
}
Else
{
Return (test2(x - y,y + 5)+ 6);
}
}
What is the recursive case for the method?
A) x < y
B) -5
C) x >= y
D) x != y

Accepted Answer

The recursive case is when x is not less than y, so the method calls itself with new parameters (x-y) and (y+5) and adds 6 to the result. This process will continue until the base case (x<y) is met.

Question 4

The depth of recursion is
A) the number of times that a method calls itself.
B) the value returned from the last recursive call.
C) the value that will terminate the recursive calls.
D) There is no such term.

Accepted Answer

The depth of recursion refers to the number of times a method calls itself before reaching the base case, which terminates the recursion.

Question 5

Look at the following pseudocode algorithm. algorithm Test14(int x)
If (x < 8)
Return (2 * x)
Else
Return (3 * Test14(x - 8)+ 8)
End Test14
What is the recursive case for the algorithm?
A) x < 8
B) 2 * x
C) x != 8
D) x >= 8

Accepted Answer

The recursive case is the else statement, which is triggered when x is greater than or equal to 8. Therefore, the best choice is D.

Question 6

Look at the following pseudocode algorithm. algorithm Test14(int x)
If (x < 8)
Return (2 * x)
Else
Return (3 * Test14(x - 8)+ 8)
End Test14
What is the base case for the algorithm?
A) x < 8
B) 2 * x
C) 3 * Test14(x - 8)+ 8
D) x >= 8

Accepted Answer

The base case for the algorithm is when x is less than 8. This is because the algorithm will recursively call itself with smaller values of x until it reaches a point where x is less than 8, at which point it will return a value directly without making any further recursive calls.

Question 7

How many times will the following method call itself,if 10 is passed as the argument? public static void message(int n)
{
If (n > 0)
{
System.out.println("Print this line. \ n");
Message(n + 1);
}
}
A) 1
B) 9
C) 10
D) An infinite number of times

Accepted Answer

The method will call itself an infinite number of times as there is no base case or condition to stop the recursion. The argument passed to the method keeps increasing by 1 with each recursive call, leading to stack overflow error eventually.

Question 8

Like a loop,a recursive method must have
A) a counter.
B) some way to control the number of times it repeats itself.
C) a return statement.
D) a predetermined number of times it will execute before terminating.

Accepted Answer

The answer of Like a loop,a recursive method must have
A)...

Question 9

A recursive method is a method that
A) uses four-letter words to tell you when you have an error.
B) keeps recurring in your program code.
C) calls itself.
D) is a method that has a loop in it.

Accepted Answer

A recursive method is a method that calls itself. It is a technique used in programming for solving problems that involve solving a smaller instance of the same problem, typically a simpler version of the original problem, until the desired solution is reached.

Question 10

Look at the following method. public static int test2(int x,int y)
{
If ( x < y)
{
Return -5;
}
Else
{
Return (test2(x - y,y + 5)+ 6);
}
}
What is returned for test2(18,5)?
A) 6
B) -5
C) 7
D) 1

Accepted Answer

Starting with x = 18 and y = 5. Since 18 > 5, we move to the else block where we call test2 with x = 18 - 5 = 13 and y = 5 + 5 = 10. This returns 7 since 13 > 10. 
Then, back in the original call, we add 6 to the result of that recursion, giving us a final result of 7 + 6 = 13. Therefore the answer is C.

Question 11

The actions that the JVM must perform any time a method is called is called
A) stack frame.
B) overhead.
C) housekeeping.
D) method calls.

Accepted Answer

Overhead refers to the extra work that the JVM has to do each time a method is called, such as allocating memory for the stack frame, setting up the stack frame, and cleaning up after the method returns.

Question 12

Look at the following method. public static int test2(int x,int y)
{
If ( x < y)
{
Return -5;
}
Else
{
Return (test2(x - y,y + 5)+ 6);
}
}
What is the depth of test2(18,5)?
A) 0
B) 1
C) 2
D) 3

Accepted Answer

When we first call test2(18,5) it goes into the else statement because 18 is not less than 5. It then calls test2(13,10) because x - y = 8 and y + 5 = 10. This call goes into the else statement because 13 is not less than 10, so it calls test2(3,15). This call goes into the else statement because 3 is not less than 15, so it calls test2(-12,20). Since -12 is less than 20, the method returns -5 to the previous call. The previous call had x = 3 and y = 15, so it returns -5 + 6 = 1 to the call before that. The call before that had x = 13 and y = 10, so it returns 1 + 6 = 7 to the first call. The first call had x = 18 and y = 5, so it returns 7 + 6 = 13.

Therefore, the depth of test2(18,5) is 3.

Question 13

The Towers of Hanoi is
A) a mathematical game
B) often used in computer science textbooks
C) demonstrates the power of recursion
D) All of the above

Accepted Answer

The Towers of Hanoi is a mathematical game that is often used in computer science textbooks to demonstrate the power of recursion. Therefore, all choices A, B, and C are correct.

Question 14

Look at the following method. public static int test2(int x,int y)
{
If ( x < y)
{
Return -5;
}
Else
{
Return (test2(x - y,y + 5)+ 6);
}
}
What is returned for test2(10,20)?
A) 6
B) 10
C) 1
D) -5

Accepted Answer

The answer of Look at the following method. public static...

Question 15

Look at the following pseudocode algorithm. Algorithm Test3(int a,int b)
If (a < b)
Return 5
Else if ( a == b)
Return -5;
Else
Return (a + Test3(a - 1,b)
End Test3
What is the recursive case for the algorithm?
A) a < b
B) a == b
C) a > b
D) None of the above

Accepted Answer

The recursive case is when a is greater than b, as the algorithm calls itself with a decreased value of a (a-1) and b remaining the same until a is no longer greater than b.

Question 16

Look at the following pseudocode algorithm. algorithm Test14(int x)
If (x < 8)
Return (2 * x)
Else
Return (3 * Test14(x - 8)+ 8)
End Test14
What value is returned for Test14(16)?
A) 8
B) 16
C) 24
D) 32

Accepted Answer

The answer of Look at the following pseudocode algorithm. algorithm...

Question 17

Look at the following pseudocode algorithm. algorithm Test14(int x)
If (x < 8)
Return (2 * x)
Else
Return (3 * Test14(x - 8)+ 8)
End Test14
What is the depth of Test14(7)?
A) 0
B) 1
C) 6
D) 7

Accepted Answer

The answer of Look at the following pseudocode algorithm. algorithm...

Question 18

Look at the following pseudocode algorithm. algorithm Test14(int x)
If (x < 8)
Return (2 * x)
Else
Return (3 * Test14(x - 8)+ 8)
End Test14
What is the depth of Test14(16)?
A) 0
B) 1
C) 2
D) 3

Accepted Answer

When Test14(16) is called, it will enter the else statement and recursively call Test14(8). Test14(8) will enter the else statement and recursively call Test14(0). Test14(0) will satisfy the if statement and return 0. Therefore, the depth of Test14(16) is 2.

Question 19

To solve a program recursively,you need to identify at least one case in which the problem can be solved without recursion - this is known as
A) the recursive case.
B) the terminal case.
C) the base case.
D) the final case.

Accepted Answer

The base case is the condition that allows the recursive function to stop calling itself and return a value. This is essential for the function to stop calling itself and avoid an infinite loop. The other answer choices are not commonly used terms to describe the initial condition of a recursive function.

Question 20

Look at the following method. public static int Test2(int x,int y)
{
If ( x < y)
{
Return -5;
}
Else
{
Return (Test2(x - y,y + 5)+ 6);
}
}
What is the base case for the method?
A) x < y
B) -5
C) Test2(x - y,y + 5)+ 6
D) +6

Accepted Answer

The base case for the method is when x is less than y, which will cause the method to immediately return -5 without any recursion.

Quiz 15: Recursion

Look at the following pseudocode algorithm. algorithm Test14(int x) If (x < 8) Return (2 * x) Else Return (3 * Test14(x - 8) + 8) End Test14 What value is returned for Test14(7) ?

Look at the following pseudocode algorithm. Algorithm Test3(int a,int b) If (a < b) Return 5 Else if ( a == b) Return -5; Else Return (a + Test3(a - 1,b) End Test3 What is the base case for the algorithm?

Look at the following method. public static int test2(int x,int y) { If ( x < y) { Return -5; } Else { Return (test2(x - y,y + 5) + 6) ; } } What is the recursive case for the method?

The depth of recursion is

Look at the following pseudocode algorithm. algorithm Test14(int x) If (x < 8) Return (2 * x) Else Return (3 * Test14(x - 8) + 8) End Test14 What is the recursive case for the algorithm?

Look at the following pseudocode algorithm. algorithm Test14(int x) If (x < 8) Return (2 * x) Else Return (3 * Test14(x - 8) + 8) End Test14 What is the base case for the algorithm?

How many times will the following method call itself,if 10 is passed as the argument? public static void message(int n) { If (n > 0) { System.out.println("Print this line. \ n") ; Message(n + 1) ; } }

Like a loop,a recursive method must have

A recursive method is a method that

Look at the following method. public static int test2(int x,int y) { If ( x < y) { Return -5; } Else { Return (test2(x - y,y + 5) + 6) ; } } What is returned for test2(18,5) ?

The actions that the JVM must perform any time a method is called is called

Look at the following method. public static int test2(int x,int y) { If ( x < y) { Return -5; } Else { Return (test2(x - y,y + 5) + 6) ; } } What is the depth of test2(18,5) ?

The Towers of Hanoi is

Look at the following method. public static int test2(int x,int y) { If ( x < y) { Return -5; } Else { Return (test2(x - y,y + 5) + 6) ; } } What is returned for test2(10,20) ?

Look at the following pseudocode algorithm. Algorithm Test3(int a,int b) If (a < b) Return 5 Else if ( a == b) Return -5; Else Return (a + Test3(a - 1,b) End Test3 What is the recursive case for the algorithm?

Look at the following pseudocode algorithm. algorithm Test14(int x) If (x < 8) Return (2 * x) Else Return (3 * Test14(x - 8) + 8) End Test14 What value is returned for Test14(16) ?

Look at the following pseudocode algorithm. algorithm Test14(int x) If (x < 8) Return (2 * x) Else Return (3 * Test14(x - 8) + 8) End Test14 What is the depth of Test14(7) ?

Look at the following pseudocode algorithm. algorithm Test14(int x) If (x < 8) Return (2 * x) Else Return (3 * Test14(x - 8) + 8) End Test14 What is the depth of Test14(16) ?

To solve a program recursively,you need to identify at least one case in which the problem can be solved without recursion - this is known as

Look at the following method. public static int Test2(int x,int y) { If ( x < y) { Return -5; } Else { Return (Test2(x - y,y + 5) + 6) ; } } What is the base case for the method?