Quiz Space

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

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.

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. Q3What is the worst case time complexity of Selection Sort ?
  4. Q4Figure question
  5. Q5Consider a graph G with V vertices and E edges represented using an adjacency list. What is the worst case complexity f…
  6. Q6Figure question
  7. Q7Figure question
  8. Q8While inserting the elements [13, 7, 26, 33, 5, 10, 12, 11, 9] in an empty binary search tree (BST) in the sequence sho…
  9. Q9Figure question
  10. Q10Figure question
  11. Q11Figure question
  12. Q12Figure question
  13. Q13Figure question
  14. Q14Figure question
  15. Q15Figure question
  16. Q16Which of the following statement is/are false?
  17. Q18Which of these correspond to non-polynomial time complexity?
  18. Q19Figure question
  19. Q20Figure question
  20. Q21Figure question
  21. Q22Figure question
  22. Q23Figure question
  23. Q24Figure question
  24. Q25Figure question