How much do you know about Recursion?

 

a. If a recursive function uses three variables a, b and c, then the same set

of variables are used during each recursive call.

Answer

True

b. If a recursive function uses three variables a, b and c, then the same set

of variables are used during each recursive call.

Answer

False

c. Multiple copies of the recursive function are created in memory.

Answer

False

d. A recursive function must contain at least 1 return statement.

Answer

True

e. Every iteration done using a while or for loop can be replaced with

recursion.

Answer

True

f. Logics expressible in the form of themselves are good candidates for

writing recursive functions.

Answer

True

g. Tail recursion is similar to a loop.

Answer

True

h. Infinite recursion can occur if the base case is not properly defined.

Answer

True

i. A recursive function is easy to write, understand and maintain as

compared to a one that uses a loop.

Answer

False