Q. When a top-down approach of dynamic programming is applied to a problem, it usually

  • (A) decreases both, the time complexity and the space complexity
  • (B) decreases the time complexity and increases the space complexity
  • (C) increases the time complexity and decreases the space complexity
  • (D) increases both, the time complexity and the space complexity
💬 Discuss
✅ Correct Answer: (B) decreases the time complexity and increases the space complexity
Explanation: the top-down approach uses the memoization technique which stores the previously calculated values. due to this, the time complexity is decreased but the space complexity is increased.

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

Explanation by: Mr. Dubey
the top-down approach uses the memoization technique which stores the previously calculated values. due to this, the time complexity is decreased but the space complexity is increased.

💬 Discussion

Related MCQs

Q. What does K refers in the K-Means algorithm which is a non-hierarchical clustering approach?

Q. The comparison tree is also called as________.

Q. Prediction can be viewed as forecasting a value

Q. Capability of data mining is to build __________models.

Q. deals with the protection of an individual’s information which is implemented while using

Q. The identity management system binds logical addresses to for reputed servers.

Q. During error reporting, ICMP always reports error messages to ________

Q. Risk should include:

Q. When high priority task is indirectly preempted by medium priority task effectively inverting the relative priority of the two tasks, the scenario is

Q. Staleness deviations relate to the a replica was updated.

📊 Question Analytics

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