Deck 15: Recursion

Question 1

Define recursion.

Answer 1

Recursion is a process of solving a problem by reducing it to smaller versions of itself.

Question 2

In recursion, the case for which a solution is obtained directly is called the ____________________ case.

Answer 2

base

Question 3

In a recursive algorithm, a general case must eventually be reduced to a base case.

Answer 3

True

Question 4

A(n) ____________________ function is a function in which the last step executed is the recursive call.

Question 5

In the Fibonacci sequence, the third Fibonacci number is the ____________________ of the first two numbers.

Question 6

____________________ control structures use a looping structure.

Question 7

An iterative function executes more slowly than its recursive counterpart.

Question 8

What does these terms refer to:

- $\gg$ Base case:

Question 9

What does these terms refer to:

- $\gg$ Directly recursive:

Question 10

What does these terms refer to:

- $\gg$ General case:

Question 11

What does these terms refer to:

- $\gg$ Indirectly recursive:

Question 12

What does these terms refer to:

- $\gg$ Iterative control structures:

Question 13

What does these terms refer to:

- $\gg$ Recursion:

Question 14

What does these terms refer to:

- $\gg$ Recursive algorithm:

Question 15

What does these terms refer to:

- $\gg$ Recursive definition:

Question 16

What does these terms refer to:

- $\gg$ Recursive function:

Question 17

What does these terms refer to:

- $\gg$ Rightmost bit (of x):

Question 18

What does these terms refer to:

- $\gg$ Tail recursive function: