Question 1

If you are building a mission control system, ____.

Accepted Answer

In a mission control system, efficiency is crucial due to the need for real-time processing and reliability.

Question 2

Consider the following definition of a recursive method. public static int recFunc(int num) {if (num >= 10) return 10; else return num * recFunc(num + 1);} What is the output of the following statement? System.out.println(recFunc(10));

Accepted Answer

The method returns 10 immediately when num is 10, so recFunc(10) returns 10 without further recursion.

Question 3

In the recursive algorithm for the nth Fibonacci number, there are ____ base case(s).

Accepted Answer

The recursive algorithm for the Fibonacci sequence typically has two base cases: F(0) = 0 and F(1) = 1.

Question 4

What is the first step in the Tower of Hanoi recursive algorithm?

Accepted Answer

The first step in the Tower of Hanoi recursive algorithm is to move the top n - 1 disks from the source needle to the auxiliary needle, using the destination needle as the intermediate.

Question 5

The third Fibonacci number is ____.

Accepted Answer

The third Fibonacci number is the sum of the first two Fibonacci numbers.

Question 6

Consider the following definition of a recursive method. public static int mystery(int[] list, int first, int last) {if (first == last) return list[first]; else return list[first] + mystery(list, first + 1, last);} Given the declaration int[] alpha = {1, 4, 5, 8, 9}; What is the output of the following statement? System.out.println(mystery(alpha, 0, 4));

Accepted Answer

The method `mystery` calculates the sum of the elements in the array `alpha` from index `first` to `last`. For `alpha = {1, 4, 5, 8, 9}` and `mystery(alpha, 0, 4)`, it sums all elements: 1 + 4 + 5 + 8 + 9 = 27.

Question 7

Assume there are four methods A, B, C, and D. If method A calls method B, method B calls method C, method C calls method D, and method D calls method A, which of the following methods is indirectly recursive?

Accepted Answer

Method A is indirectly recursive because it calls method B, which calls method C, which calls method D, which calls method A.

Question 8

____ is NOT an iterative control structure.

Accepted Answer

Recursion is not an iterative control structure; it is a process where a function calls itself to solve a problem.

Question 9

Consider the following definition of a recursive method. public static int strange(int[] list, int first, int last) {if (first == last) return list[first]; else return list[first] + strange(list, first + 1, last);} Given the declaration int[] beta = {2, 5, 8, 9, 13, 15, 18, 20, 23, 25}; What is the output of the following statement? System.out.println(strange(beta, 4, 7));

Accepted Answer

The answer of Consider the following definition of a recursive...

Question 10

Using a recursive algorithm to solve the Tower of Hanoi problem, a computer that can generate one billion moves per second would take ____ years to solve the problem.

Accepted Answer

The answer of Using a recursive algorithm to solve the...

Quiz 13: Recursion