📊 Problem Solving and Python Programming
Q. Which of these is not true about recursion?
  • (A) making the code look clean
  • (B) a complex task can be broken into sub- problems
  • (C) recursive calls take up less memory
  • (D) sequence generation is easier than a nested iteration
💬 Discuss
✅ Correct Answer: (C) recursive calls take up less memory

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

Explanation by: Mr. Dubey
recursive calls take up a lot of memory and time as memory is taken up each time the function is called.

💬 Discussion

Related MCQs

Q. Consider the expression T & F ∧ T. What is the number of ways in which the expression can be parenthesized so that the output is T (true)?

Q. C(W)__Θ(W) for optimality (necessary condition).

Q. The objective of the support vector machine algorithm is to find a hyperplane in an N-dimensional space(N — the number of features) that distinc

Q. Problems occurs if we don’t implement a proper locking strategy

Q. The LINK instruction is always followed by instruction.

Q. namei() is

Q. Which of the following is a characteristic of an Agile leader?

Q. Validation refers to the set of tasks that ensure that software correctly implements a specific function.

Q. How does machine learning benefit IDSes/IPSes?

Q. A computer which has the microprocessor as ____________ is called as a microcomputer

📊 Question Analytics

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