Problem Solving and Python Programming MCQs | Page - 12

 there are many other problems can also be solved using recursion.

 the speed of a program using recursion is slower than the speed of its non- recursive equivalent.

 the test(i-1,i+j) part of the function keeps calling the function until the base condition of the function is satisfied.

 the above code gives the binary equivalent of the number.

 a recursive function is tail recursive when recursive call is executed by the function in the last.

 a recursive function is tail recursive when recursive call is executed by the function in the last.

 a recursive function needn’t have a return value.

 in recursion, the function calls itself till the base condition is reached whereas iteration means repetition of process for example in for-loops.

 the program will run until the system gets out of memory.

 recursive calls take up a lot of memory and time as memory is taken up each time the function is called.