Question 1

A stack exhibits what behavior?

Accepted Answer

The answer of A stack exhibits what behavior?...

Question 2

Not all recursive definitions may be written iteratively.

Accepted Answer

A) True 
 B)False

Question 3

In a recursive power function that calculates some base to the exp power, what is the recursive call?

Accepted Answer

return bas

Question 4

The recursive definition of a Fibonacci Number is Fn) = Fn-1) + Fn-2), where F0)=1 and F1)=1. What would be the recursive function call in a recursive implementation of this?

Accepted Answer

A)  return; 
B)  return fibn) + fibn-1) 
C)  return fibn-1)+fibn-2) 
D)  return 1; 
A)  return; 
B)  return fibn) + fibn-1) 
C)  return fibn-1)+fibn-2) 
D)  return 1;

Question 5

A definition that defines a concept or a formula in terms of the concept or formula is called

Accepted Answer

A)  a recursive definition 
B)  indecision 
C)  iteration 
D)  reduction 
A)  a recursive definition 
B)  indecision 
C)  iteration 
D)  reduction

Question 6

You may have at most 1 recursive call in a recursive function.

Accepted Answer

A) True 
 B)False

Question 7

The recursive definition of a Fibonacci Number is Fn) = Fn-1) + Fn-2), where F0)=1 and F1)=1. What is the value of Fib3)?

Accepted Answer

A)  8 
B)  5 
C)  2 
D)  1 
A)  8 
B)  5 
C)  2 
D)  1

Question 8

The operating system uses a stack to control recursion.

Accepted Answer

A) True 
 B)False

A stack exhibits what behavior?

Not all recursive definitions may be written iteratively.

In a recursive power function that calculates some base to the exp power, what is the recursive call?

The recursive definition of a Fibonacci Number is Fn) = Fn-1) + Fn-2), where F0)=1 and F1)=1. What would be the recursive function call in a recursive implementation of this?

A definition that defines a concept or a formula in terms of the concept or formula is called

You may have at most 1 recursive call in a recursive function.

The recursive definition of a Fibonacci Number is Fn) = Fn-1) + Fn-2), where F0)=1 and F1)=1. What is the value of Fib3)?

The operating system uses a stack to control recursion.

Introduction to Computer and C++ Programming

C++ Basics

More Flow of Control

Procedural Abstraction and Functions That Return a Value

Functions for All Sub Tasks

Io Streams As an Introduction to Objects and Classes

Arrays

Strings and Vectors

Pointers and Dynamic Arrays

Defining Classes

Friends, Overloaded Operators, and Arrays in Classes

Separate Compilation and Namespaces

Pointers and Linked Lists

Inheritance

Exception Handling

Templates

Standard Template Library

Filters

Exam 14: Recursion

A stack exhibits what behavior?

Not all recursive definitions may be written iteratively.

In a recursive power function that calculates some base to the exp power, what is the recursive call?

The recursive definition of a Fibonacci Number is Fn) = Fn-1) + Fn-2), where F0)=1 and F1)=1. What would be the recursive function call in a recursive implementation of this?

A definition that defines a concept or a formula in terms of the concept or formula is called

You may have at most 1 recursive call in a recursive function.

The recursive definition of a Fibonacci Number is Fn) = Fn-1) + Fn-2), where F0)=1 and F1)=1. What is the value of Fib3)?

The operating system uses a stack to control recursion.

Introduction to Computer and C++ Programming

C++ Basics

More Flow of Control

Procedural Abstraction and Functions That Return a Value

Functions for All Sub Tasks

Io Streams As an Introduction to Objects and Classes

Arrays

Strings and Vectors

Pointers and Dynamic Arrays

Defining Classes

Friends, Overloaded Operators, and Arrays in Classes

Separate Compilation and Namespaces

Pointers and Linked Lists

Inheritance

Exception Handling

Templates

Standard Template Library

Filters