- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Which of the following problems can’t be...

Q. |
## Which of the following problems can’t be solved using recursion? |

A. | factorial of a number |

B. | nth fibonacci number |

C. | length of a string |

D. | problems without base case |

Answer» D. problems without base case | |

Explanation: problems without base case leads to infinite recursion call. in general, we will assume a base case to avoid infinite recursion call. problems like finding factorial of a number, nth fibonacci number and |

View all MCQs in:
Design and Analysis of Algorithms

- Which of the following problems is NOT solved using dynamic programming?
- Which of the following problems should be solved using dynamic programming?
- Which of the following problems can be solved using the longest subsequence problem?
- Problems that can be solved in polynomial time are known as?
- is the class of decision problems that can be solved by non- deterministic polynomial algorithms?
- Problems that cannot be solved by any algorithm are called?
- Recursion is similar to which of the following?
- Recursion is a method in which the solution of a problem depends on
- The travelling salesman problem can be solved using
- You are given infinite coins of denominations v1, v2, v3,…..,vn and a sum S. The coin change problem is to find the minimum number of coins required to get the sum S. This problem can be solved using

Login to Continue

It will take less than 2 minutes

Report MCQ