Summative #7

Question 1

What are the mandatory parts of a function declaration?

Answer 1

return type and function name

Question 2

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

Answer 2

void

Question 3

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

Answer 3

True

Question 4

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

Answer 4

the solutions to smaller instances of the same problem.

Question 5

Which data structure is used to perform recursion?

Answer 5

Stack

Question 6

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

Answer 6

Problems without base case

Question 7

The case in which the routine calls itself to perform a subtask is called as

Answer 7

recursive case

Question 8

Recursion is similar to which of the following?

Answer 8

a loop

Question 9

Which of the following problems can be solved using recursion?

Answer 9

i. Factorial of a number
ii. Nth Fibonacci number
iii. Length of a string

Question 10

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

Answer 10

True

Question 11

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

Answer 11

True

Question 12

A function that can be made to return a single value to the calling program is referred to as void function.

Answer 12

True

Question 13

The function prototype contains different information than the function header contains.

Answer 13

False

Question 14

If a variable is declared inside a function, what kind of variable is this?

Answer 14

Local Variable

Question 15

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

Answer 15

False

Question 16

The following are problems that often have simple recursive solutions except ________.

Answer 16

display an output

Question 17

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

Answer 17

False

Question 18

The recursive routine always contains a selection statement-either an “if” or a “switch”.

Answer 18

True

Question 19

Any problem that can be solved recursively cannot also be solved iteratively.

Answer 19

False

Question 20

How many recursive calls does the following method contain?

Answer 20

2

Question 21

When a recursive function is executed, the recursive calls are implemented instantly.

Answer 21

False

Question 22

A ____________________ structure is the main control structure in a recursive routine, and a ____________________ structure is the main control structure in an iterative routine

Answer 22

branching, looping

Question 23

In for loop, the part that defines how the loop control variable will change each time the loop is repeated.

Answer 23

increment decrement

Question 24

A continue statement causes execution to skip to ______

Answer 24

the next iteration of the loop

Question 25

Which looping process is best used when the number of iterations is known

Answer 25

For loop

Question 26

Which looping process is best used when the number of iterations is known?

Answer 26

For Loop

Question 27

In do-while, statements in the loop are executed first at least once

Answer 27

True

Question 28

Where should the prototype be?

Answer 28

before the int main()

Question 29

What is the value returned as a result when mystery(3) is called?

Answer 29

27

Question 30

Running out of memory may occur due to ______

Answer 30

Recursive function call

Question 31

Recursion makes our code shorter and cleaner.

Answer 31

True

Question 32

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

Answer 32

True

Question 33

What is the scope of the variable declared in the user defined function?

Answer 33

only inside the { } block

Question 34

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

Answer 34

Yes

Question 35

Only predefined functions can be involved in recursion.

Answer 35

False/ only user defined

Question 36

All the recursive calls are pushed onto the stack

Answer 36

Yes

Question 37

How many times is the recursive function called, when the following code is executed?

Answer 37

11

Question 38

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

Answer 38

Arguments

Question 39

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

Answer 39

;

Question 40

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

Answer 40

True

Question 41

What will be the output of the following code? my_recursive_function(100);

Answer 41

cannot be determined

Question 42

Any routine that calls itself is recursive.

Answer 42

True

Question 43

Which of the following statement is correct?

Answer 43

All the parameters of a function can be default parameters.

Question 44

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

Answer 44

calling function

Question 45

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.

Answer 45

Base Case