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
💬 Discuss
✅ Correct 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

Published by Mr. Dubey ⭐ 104.82K Points at 16-Sep-2023 03:43 pm in Design and Analysis of Algorithms

Explanation by: Mr. Dubey
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

💬 Discussion

Related MCQs

Q. What is meant by a dedicated computer?

Q. The effectiveness of the cache memory is based on the property of ________

Q. Central Processing Unit is combination of

Q. Which of the following umask settings doesn’t allow execute permission to be set by default on directory files

Q. Which of the following benefit is provided by the PaaS service provider

Q. Lempel-Ziv algorithm is

Q. A magnitude comparator is defined as a digital comparator which has

Q. If every non-key attribute is functionally dependent on the primary key, the relation will be in

Q. What is the important criterion in deciding what testing technique to use?

Q. The SQL command to creating a table is:

📊 Question Analytics

👁️
901
Total Visits
📽️
3 y ago
Published
🎖️
Mr. Dubey
Publisher
📈
86%
Success Rate