Functions and Introduction to Recursion Quiz

What is a recursive function?

• A function that returns multiple values

• A function that calls another function

• A function that uses loops

• A function that calls itself

What does a recursive function know how to solve?

• Only even numbers

• Only odd numbers

• Only complex problems

• Only the simplest cases or base cases

What is the factorial of 0?

• 3

• 2

• 1

• 0

How can the factorial of an integer be calculated iteratively?

• By using a conditional statement

• By using a switch statement

• By using recursion

• By using a loop

What is the recursive definition of the factorial function?

• n! = n * (n - 1)

• n! = n + (n - 1)!

• n! = n / (n - 1)

• n! = n - (n - 1)

What is the value of 5!?

• 60

• 120

• 30

• 15

What is the purpose of using recursion to calculate factorials?

• To make the calculation faster

• To make the calculation more complex

• To make the calculation easier

• To make the calculation more efficient

What is the type of C++11's unsigned long long int?

• At least 32 bytes

• At least 16 bytes

• At least 8 bytes

• At least 4 bytes

What is the Fibonacci series?

• A series that starts with 1 and 2

• A series of even numbers

• A series of prime numbers

• A series that starts with 0 and 1

How is the Fibonacci series defined recursively?

• fibonacci(0) = 1, fibonacci(1) = 0, fibonacci(n) = fibonacci(n - 1) - fibonacci(n - 2)

• fibonacci(0) = 1, fibonacci(1) = 1, fibonacci(n) = fibonacci(n - 1) + fibonacci(n - 2)

• fibonacci(0) = 0, fibonacci(1) = 1, fibonacci(n) = fibonacci(n - 1) + fibonacci(n - 2)

• fibonacci(0) = 0, fibonacci(1) = 1, fibonacci(n) = fibonacci(n - 1) - fibonacci(n - 2)