Vidyalelo
Data Structure · Q255

Dynamic Programming in Data Structures

Programming · Data Structure · question 255

Q255

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
Answer
C.
Increases the time complexity and decreases the space complexity
D.
Increases both, the time complexity and the space complexity

Answer: Option B

Solution

Answer: Option B
No explanation is given for this question Let's Discuss on Board