Recursive Functions in Python

A recursive function is

• A function that calls other functions in a recursive way.

• Any function that calls itself is called recursive

• A function that has a base case or termination condition

• None of the above

Name the condition at which the recursive method will stop calling itself.

• Base case

• Worst Case

• Best Case

• None of the above

The program may run out of memory in a

• non-recursive function call

• recursive function call

• condition when too many variables are declared

• none of the above

Which of the following condition is true?

• Recursion is always better than iteration.

• Recursion uses more memory as compared to iteration.

• Recursion uses less memory as compared to iteration.

• Iteration is always better and simpler than recursion.

Which of the following problems can be solved using recursion?

• finding Nth number of the Fibonacci sequence

• finding the factorial of a number

• finding the length of a string

• all of the above

Recursion is similar to which of the following?

• if-else

• switch-case

• loops

• none of the above

What is the returned value of recmethod(5)?

• 68

• 70

• 75

• 82

What is printed as a result of the call stri("COMPSCI")?

• COMPSCI

  COMPSC

  COMPS

  COMP

  COM

  CO

  C

• COMPSCI

  OMPSCI

  MPSCI

  PSCI

  SCI

  CI

  I

• CO

  COM

  COMP

  COMPS

  COMPSC

  COMPSCI

• C

  CO

  COM

  COMP

  COMPS

  COMPSC

  COMPSCI

Will rec(5) iterate infinitely?

• Yes

• No

Which of the following cannot be converted in a recursion function?

• Factorial program

• random function generation

• binary search

• Greatest common divisor(GCD)