Quiz on Recursion in Python

1. Question

Which of the following best defines the recursion of a function?

The process of calling the function within itself

Correct Incorrect Correct answer

The process of calling another instance of the function within itself directly or indirectly

Correct Incorrect Correct answer

The process of calling the same function with the same parameters

Correct Incorrect Correct answer

Both b and c

Correct Incorrect Correct answer

2. Question

Which of the following is true about a recursive function?

Every recursive function should have a base case

Correct Incorrect Correct answer

A nonrecursive function can be converted to a recursive function

Correct Incorrect Correct answer

A recursive function makes the code look more readable

Correct Incorrect Correct answer

All the above

Correct Incorrect Correct answer

3. Question

What does infinite recursion mean?

The problem where the function calls itself infinite times

Correct Incorrect Correct answer

The problem where the base condition is never reached

Correct Incorrect Correct answer

The problem where the return value reaches infinite

Correct Incorrect Correct answer

Both a and b

Correct Incorrect Correct answer

4. Question

What is the output of the below code?

def func(x):

if(x==0 or x==1):

return 1

return func(x-1)*x

func(6)

120

Correct Incorrect Correct answer

720

Correct Incorrect Correct answer

SyntaxError

Correct Incorrect Correct answer

TypeError

Correct Incorrect Correct answer

5. Question

Which of the following function calls lead to infinite recursion in the below code?

def fun(a):

if(a==0):

return 0

return a*fun(a-1)

fun(0)

Correct Incorrect Correct answer

fun(9)

Correct Incorrect Correct answer

fun(-3)

Correct Incorrect Correct answer

None of these

Correct Incorrect Correct answer

6. Question

What does the function in the below code do?

def func(x):

if(len(x)==0):

return True

if x[0]!=x[-1]:

return False

return func(x[1:-1])

Check for palindrome

Correct Incorrect Correct answer

Check of all the characters are not empty

Correct Incorrect Correct answer

Check if the string is of even length

Correct Incorrect Correct answer

None of the above

Correct Incorrect Correct answer

7. Question

Which of the following is a disadvantage of recursive function?

It consumes more memory

Correct Incorrect Correct answer

Looks complex

Correct Incorrect Correct answer

Not easy to generate sequences

Correct Incorrect Correct answer

All the above

Correct Incorrect Correct answer

8. Question

What is the output of the below code?

def func(x):

if x==0:

return 0

return x+func(x-1)

func(-5)

15

Correct Incorrect Correct answer

-15

Correct Incorrect Correct answer

SyntaxError

Correct Incorrect Correct answer

RecursionError

Correct Incorrect Correct answer

9. Question

Which of the following is true about tail recursion?

The process where the outputs of recursion are returned in the reverse order

Correct Incorrect Correct answer

The process where the function calls itself at the end

Correct Incorrect Correct answer

The process where we do not need t keep track of the previous recursion

Correct Incorrect Correct answer

Both b and c

Correct Incorrect Correct answer

10. Question

What is the output of the below code?

def fun(a):

if(a>50):

return a-3

return fun(fun(a+5))

49

Correct Incorrect Correct answer

47

Correct Incorrect Correct answer

53

Correct Incorrect Correct answer

RecursionError

Correct Incorrect Correct answer

11. Question

To find the length of the sequence in a recursive way, in the below code find the missing statement.

def length(seq):

if(bool(seq)==False):

return 0

**missing line**

return 1+length (seq[1:])

Correct Incorrect Correct answer

return length (seq[:-1]) +1

Correct Incorrect Correct answer

return length (seq[:-1])

Correct Incorrect Correct answer

Both a and b

Correct Incorrect Correct answer

12. Question

What is the output of the below code?

def func(x):

if(len(x)==0):

return

print(x[0]%2==0,end=” “)

return func(x[1:])

func([1,2,3,4,5])

True False True False True

Correct Incorrect Correct answer

False True False True False

Correct Incorrect Correct answer

SyntaxError

Correct Incorrect Correct answer

RecursionError

Correct Incorrect Correct answer

13. Question

How many times does the below function recur?

def func(x):

if(x>20):

return 0

if(x%2):

return 1+func(x+1)

return 1+func(x+3)

func(1)

11

Correct Incorrect Correct answer

13

Correct Incorrect Correct answer

10

Correct Incorrect Correct answer

9

Correct Incorrect Correct answer

14. Question

For the function calculating the sum of all natural numbers till n, which of the following base suits the best?

if n==0:return 0

Correct Incorrect Correct answer

if n>0: return 0

Correct Incorrect Correct answer

if n<=0: return 0

Correct Incorrect Correct answer

None of the above

Correct Incorrect Correct answer

15. Question

Find the output of the below code.

def fun(s):

if(len(s)==1):

return s[0].upper()

return fun(s[:-1])+s[-1].lower()

'Python'

Correct Incorrect Correct answer

'Nohtyp'

Correct Incorrect Correct answer

'pythoN’

Correct Incorrect Correct answer

'nohtyP'

Correct Incorrect Correct answer

Quiz on Recursion in Python

Quiz on Recursion in Python

Quiz Summary

Information

Results

Results

Categories

1. Question

2. Question

3. Question

4. Question

5. Question

6. Question

7. Question

8. Question

9. Question

10. Question

11. Question

12. Question

13. Question

14. Question

15. Question