Quiz Space

Programming, Data Structures and Algorithms using Python · End Term · 13 Apr 2025 · January 2025 term · Set QDD1

Question 17: Which of the below statements are true about Dynamic pro…

Question 17

+4 marksOne or more correct options

Which of the below statements are true about Dynamic programming?

Select all that apply.

  1. A

    Increases both time complexity and space complexity.

  2. B

    It replaces recursion with iteration, so there are no stack overflow errors.

  3. C

    Increases time complexity and decreases space complexity.

  4. D

    It avoids computing sub-problems more than once.

Show answer

Correct answers

  • B

    It replaces recursion with iteration, so there are no stack overflow errors.

  • D

    It avoids computing sub-problems more than once.

See the whole paperTake it as a mock test

Question 17 of 25 in the IIT Madras BS Programming, Data Structures and Algorithms using Python (PDSA) End Term paper sat on 13 Apr 2025, in the January 2025 term (IIT M DIPLOMA AN EXAM QDD3 13 Apr 2025). It carries 4 marks.

This question was also asked in

More questions from this paper

  1. Q1Figure question
  2. Q2Figure question
  3. Q3Figure question
  4. Q4Figure question
  5. Q5Figure question
  6. Q6Figure question
  7. Q7Figure question
  8. Q8Figure question
  9. Q9While inserting the elements [16, 8, 19, 13, 26, 21, 23, 14, 31] in an empty binary search tree (BST) in the sequence s…
  10. Q10Figure question
  11. Q11Figure question
  12. Q12Figure question
  13. Q13Figure question
  14. Q14Figure question
  15. Q15Figure question
  16. Q16Suppose we obtain the following BFS tree rooted at node G for an undirected graph with vertices {A, B, C, D, E,F, G, H,…
  17. Q18Figure question
  18. Q19Which of these correspond to non-polynomial time complexity?
  19. Q20Figure question
  20. Q21What is the weight of the minimum spanning tree for the given graph?
  21. Q22Figure question
  22. Q23Figure question
  23. Q24Figure question
  24. Q25Figure question