Programming Techniques in C++ Final Review

What is a recursive function?

• A function that calls itself
• A function that iterate a set of statements a number of times

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

• Larger instances of different problems
• Larger instances of the same problem
• Smaller instances of the same problem
• Smaller instances of different problems

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

• Factorial of a number
• Nth fibonacci number
• Length of a string
• Problems without base case

Recursion is similar to which of the following?

• Switch Case
• Loop
• If-else
• If elseif else

In recursion, the condition for which the function will stop calling itself is ____________

• Base case
• Best case
• Worst case
• There is no such condition

What will happen if we call Mysterious(10);

• The code will show a compile time error

• 10 is output continuously until stack overflows

What will be printed out if we call Mysterious(5);

• 5

• 1

• 5 4 3 2 1 0

• 5 4 3 2 1

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

• 4

• 5

• 6

• 7

What is the output of the following code?

• 123456789

• 10

• 9

• -1

What will be printed out if we call Mysterious(200);

• True

• False