- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Recursive approach to find power of a nu...

Q. |
## Recursive approach to find power of a number is preferred over iterative approach. |

A. | true |

B. | false |

Answer» B. false | |

Explanation: the recursive code requires memory in call stack which makes it less preferable as compared to iterative approach. |

View all MCQs in:
Design and Analysis of Algorithms

- What is the advantage of iterative code for finding power of number over recursive code?
- How many recursive calls are there in Recursive matrix multiplication by Strassen’s Method?
- Which of the following recursive formula can be used to find the factorial of a number?
- What is the time complexity of the recursive implementation used to find the nth fibonacci term?
- What is the space complexity of the recursive implementation used to find the nth fibonacci term?
- Recursive program to raise an integer x to power y uses which of the following algorithm?
- What is the number of swaps required to sort the array arr={5,3,2,4,1} using recursive selection sort?
- What is the time complexity of the above recursive implementation used to reverse a string?
- What will be the recurrence relation of the code of recursive selection sort?
- What will be the best case time complexity of recursive selection sort?

Login to Continue

It will take less than 2 minutes

Report MCQ