Recursive Functions and Data Structures

When a function A calls a function B, which in turn calls A, we have

• function call cycling

• indirect recursion

• perfect recursion

• direct recursion

The solvable known problem in a recursive function is called the inductive step.

• True

• False

The case for which the solution is expressed in smaller version of itself.

• Terminal Case

• Base Case

• Iterate Case

• Recursive Case

Recursive algorithms tend to be less efficient than iterative algorithms.

• True

• False

Each time a recursive call is invoke same instance of the parameters (if any) are used.

• True

• False

A Recursive Call is a function call in which the function being called is the same as the one making the call.

• True

• False

• 1

• 3

• 0

• 2

The depth of the recursion is the number of times a recursive call is made until it reaches a base case.

• True

• False

Below are characteristics of a dynamic stack, except:

• Can be implemented with a dynamic array

• Shrink in size as needed

• Can be implemented with a linked list

• Grow in size as needed

In a DYNAMIC STACK, the node that was POPPED is deleted.

• True

• False