Question 1

TRUE OR FALSE. The program that calls a function is often referred to as the
calling program.

Accepted Answer

True

Question 2

The number of actual arguments must be _________ as the
number of formal parameters.

Accepted Answer

equal

Question 3

Which is NOT an essential feature of a proper recursive
function?

Accepted Answer

Not permitted to do any I/O

Question 4

TRUE OR FALSE. The only difference between the header and the prototype is the
colon.

Accepted Answer

False

Question 5

TRUE OR FALSE. Formal parameters are variables used within the function
header that receives a copy of the actual argument values.

Accepted Answer

TRUE

Question 6

A segment that groups a number of program statements to
perform specific task

Accepted Answer

function

Question 7

It provides one-way communication of data from the calling
program to the function.

Accepted Answer

pass by value

Question 8

A function that can be made to return a single value to the
calling program.

Accepted Answer

non-void

Question 9

How many minimum number of functions are needed to be
presented in C++?

Accepted Answer

1

Question 10

Here is a function, double numbers (int x), what is the name of
this function?

Accepted Answer

numbers

Question 11

Which of the following is used to terminate the function
prototype?

Accepted Answer

;

Question 12

TRUE OR FALSE. If the function returns a value then the return_type must be void.

Accepted Answer

FALSE

Question 13

If we have a function int stop (int n) , can we send it a different
variable in the main program? For example, stop (x)

Accepted Answer

Yes

Question 14

Recursion is a method in which the solution of a problem
depends on ____________

Accepted Answer

Smaller instances of the same problem

Question 15

TRUE OR FALSE. Recursion can be more difficult to debug compared to an
equivalent iterative program.

Accepted Answer

TRUE

Question 16

Consider the following code snippet:
void my_recursive_function()
{
my_recursive_function();
}
int main()
{
my_recursive_function();
return 0;
}
What will happen when the above snippet is executed?

Accepted Answer

The code will run for some time and stop when the stack
overflows

Question 17

TRUE OR FALSE. A recursive program cannot call itself always, or it would never
stop at some point, the routine encounters a subtask that it can
perform without calling itself. This case is called the recursive
case.

Accepted Answer

False

Question 18

If a variable is declared outside a function and can be used by
other functions, what kind of variable is this?

Accepted Answer

global variable

Question 19

What’s the output of the calling something(4);?
int something(int number)
{
if(number <= 0)
return 1;
else
return number * something(number-1);
}

Accepted Answer

24

Question 20

The variable that receives a copy of the value passed by the
actual argument in the program is ________.

Accepted Answer

a

Question 21

What is the value returned by the recursive function if the base
condition is met?
recursion1.PNG

Accepted Answer

1

Question 22

When flow of control is transferred to the calling program,
program execution resumes

Accepted Answer

on the next statement after the function call

Question 23

Which of the following statements is true?

Accepted Answer

Recursion uses more memory compared to iteration

Question 24

TRUE OF FALSE. Only predefined functions can be involved in recursion.

Accepted Answer

FALSE

Question 25

What is the output of the following code?
void my_recursive_function(int n)
{
if(n == 0)
return;
cout<<n;
my_recursive_function(n-1);
}
int main()
{
my_recursive_function(10);
return 0;
}

Accepted Answer

10 9 8...1

Question 26

TRUE OR FALSE. The case in which the routine calls itself to perform a subtask, is
called as base case.

Accepted Answer

FALSE

Question 27

Given the following code:
int func(int a, int b){
if(b==0)
return 0;
if(b==1)
return a;
return a + func(a,b-1);
}
what will be the output of func(3,8) .

Accepted Answer

24

Question 28

How many times is the recursive function called, when the
following code is executed?
void my_recursive_function(int n)
{
if(n == 0)
return;
cout<<n;
my_recursive_function(n-1);
}
int main()
{
my_recursive_function(10);
return 0;
}

Accepted Answer

11

Question 29

Recursion is similar to which of the following?

Accepted Answer

loop

Question 30

Which data structure is used to perform recursion?

Accepted Answer

stack

Question 31

What is the output of the program?
Consider the following recursive function fun(x, y). What is the
value of fun(4, 3)
int fun(int x, int y)
{
if (x == 0)
return y;
return fun(x - 1, x + y);
}

Accepted Answer

13

Question 32

Say we have a function, double subtract (double x, double y),
what is the correct way to call this function in the main
program?

Accepted Answer

subtract (x,y);

Question 33

By default how the value are passed in C++?

Accepted Answer

call by value

Question 34

TRUE OR FALSE. The correspondence between actual and formal parameter is
one-to-one basis according to the respective orders.

Accepted Answer

True

Question 35

What will happen while using pass by reference?

Accepted Answer

The location of variable in memory is passed to the function so
that it can use the same memory area for its processing

Question 36

TRUE OR FALSE. A recursive routine performs a task in part by calling itself to
perform the subtasks.

Accepted Answer

TRUE

Question 37

Which of the following problems can be solved using recursion?
i. Factorial of a number
ii. Nth Fibonacci number
iii. Length of a string

Accepted Answer

i,ii,iii

Question 38

TRUE OR FALSE. Any routine that calls itself is recursive

Accepted Answer

TRUE

Question 39

Recursion itself cannot be used as a replacement to iteration or
looping

Accepted Answer

False

Question 40

What will be the output of the following code?
int cnt=0;
void my_recursive_function(int n)
{
if(n == 0)
return;
cnt++;
my_recursive_function(n/10);
}
FORMATIVE 7
TN03
int main()
{
my_recursive_function(123456789);
cout<<cnt;
return 0;
}

Accepted Answer

9

Question 41

Which of the following problems can’t be solved using recursion?

Accepted Answer

Problems without base case

Question 42

It consists of data type, name of the function and parameter
listing.

Accepted Answer

function header

Question 43

Which of the following is important in a function?

Accepted Answer

Both return type and function name

Question 44

Here is a function, double numbers (int x), what data type will
this function return?

Accepted Answer

Double

Question 45

TRUE OR FALSE. Any problem that can be solved recursively cannot also be
solved iteratively.

Accepted Answer

FALSE

Question 46

What’s happen if the base condition is not defined in recursion?

Accepted Answer

Stack Overflow

Question 47

TRUE OR FALSE. A branching structure is the main control structure in a
recursive routine while a looping structure is the main control
structure in an iterative routine.

Accepted Answer

TRUE

Question 48

Where does the return statement returns the execution of the
program?

Accepted Answer

calling function

Question 49

Where should the prototype be?

Accepted Answer

before int main()

Question 50

Which of the following statements is not correct?

Accepted Answer

When the function cube() was called, the argument used is
passed by reference.

Question 51

What is the scope of the global variable declared outside the
user defined function and after the preprocessor directive?

Accepted Answer

Whole program

Question 52

Consider this piece of code:
void mysterious(int i, int &k)
{ i = 1; k = 2; }
int main ()
{ int x = 0;
FORMATIVE 7
TN03
mysterious (x, x);
cout << x << endl;
return 0;
}

Accepted Answer

2

Question 53

What are mandatory parts in function declaration?

Accepted Answer

return type,function name

Question 54

TRUE OR FALSE. All the recursive calls are pushed onto the stack

Accepted Answer

TRUE

Question 55

void print(int n)
{
if (n == 0)
return;
cout<<n%2;
cout<<n/2;
}
What will be the output of print(12)?

Accepted Answer

0011

Question 56

What does the following recursive code do?
void my_recursive_function(int n)
{
if(n == 0)
return;
FORMATIVE 7
TN03
my_recursive_function(n-1);
cout<<n;
}
int main()
{
my_recursive_function(10);
return 0;
}

Accepted Answer

Prints the numbers from 1 to 10

Question 57

_______________ is a powerful technique which is used to invoke a
function.

Accepted Answer

Recursion

Question 58

TRUE OR FALSE. Recursion makes our code shorter and cleaner.

Accepted Answer

TRUE

Question 59

TRUE OR FALSE. The recursive routine always contains a selection
statement-either an "if" or a "switch".

Accepted Answer

TRUE

Question 60

Running out of memory may occur due to ______

Accepted Answer

recursive function call

Question 61

TRUE OR FAlSE. function is a self contained block of code with a specific
purpose.

Accepted Answer

TRUE

Question 62

This symbol specifies that the corresponding arguments in the
function are to be passed by reference.

Accepted Answer

&

Question 63

Here is a function, double numbers (int x), what data type will
this function take in?

Accepted Answer

int

Question 64

TRUE OR FALSE. Function prototype provides the basic information about a
function which tells the compiler that the function is used
correctly or not.

Accepted Answer

True

"Know" box contains:
Time elapsed:
Retries:

Stack #4001948