Chapter - 4 Recursions Textbook MCQs

Which of the following is/are needed for recursion?

• Expressing a function in terms of itself

• Specifying the base condition

• Both

• None of the above

Which of the following are the types of recursion?

• Direct Recursion

• Indirect Recursion

• Both

• None of the above

What happens if no base case is specified, in a recursive procedure?

• Stack overflow

• Underflow

• Compile time error

• None of the above

Which of the following can be implemented using recursion?

• Factorial

• Power

• Fibonacci series

• All of the above

Which of the following can be intuitively implemented using recursion?

• Binary Search

• Linear Search

• Both

• None of the above

A list is to be reversed using recursion. Which of the following represents the base case?

• rev(L) = L, if len(L) = 1

• rev(L) = rev(L[1:]), if len(L) = 1

• rev(L) = rev(L[1:]), if len(L) = 0

• None of the above

The sum of elements of a list is to be evaluated using recursion. Which of the following represents the base case?

• sum(L) = L[0], if len(L) = 1

• sum(L) = 0 , if len(L) = 0

• Both

• All of the above

A string is to be reversed using recursion. Which of the following represents the base case?

• rev(str1) = '', if str1==''

• rev(str1) = str1[0],

  if str1 =''

• Both

• All of the above

A number to be reversed using recursion. Which of the following represents the base case?

• rev(n) = n, if n ==0

• rev(n) = n,
  if n % 10 == 0

• Both

• None of the above

Which of the following is the base case for the Euler's formula?

• gcd(a,0) = 1

• gcd(a,1) = 1

• gcd(a,a) = 1

• All of the above

Answer explanation

The answer is actually gcd(a,0) = a