FiltersDone

Question type

Essay

Multiple Choice

Short Answer

True False

Matching

Exam 15: Recursion

Show Answer

Share

---

All types

Filters

Study Flashcards

Question 1

Short Answer

Review LaterAdd Note

Review Later

What does these terms refer to: - $\gg$ Rightmost bit (of x):

Correct Answer

verified

the remainder of x after division by 2

Question 2

Short Answer

Review LaterAdd Note

Review Later

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

Correct Answer

verified

Show Answer

Question 3

Short Answer

Review LaterAdd Note

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

What does these terms refer to: - $\gg$ Recursive algorithm:

What does these terms refer to: - $\gg$ General case:

What does these terms refer to: - $\gg$ Directly recursive:

What does these terms refer to: - $\gg$ Indirectly recursive:

____________________ control structures use a looping structure.

What does these terms refer to: - $\gg$ Recursive function:

What does these terms refer to: - $\gg$ Recursion:

An iterative function executes more slowly than its recursive counterpart.

What does these terms refer to: - $\gg$ Iterative control structures:

What does these terms refer to: - $\gg$ Recursive definition:

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

What does these terms refer to: - $\gg$ Tail recursive function:

What does these terms refer to: - $\gg$ Base case:

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

Define recursion.