UTpaper

Free mock tests & test series

Question 80Asked in Bihar STET 2025 Paper II Computer Science, 3 Nov 2025, Shift 1 (9:00 AM)

Which property of dynamic programming is particularly useful for solving Optimal

Which property of dynamic programming is particularly useful for solving Optimal Binary Search Tree problems?
  1. AOptimal substructure
  2. BGreedy choice property
  3. CDivide and Conquer
  4. DLinear programming
Show answerHide answer

Correct answer: (A) Optimal substructure

Explanation

Optimal BST is solved by dynamic programming because it has optimal substructure: the best tree contains optimal subtrees for its left and right key ranges (and the subproblems overlap).

From Bihar STET 2025 Paper II Computer Science PYQ, 3 Nov 2025, Shift 1 (9:00 AM)

This is question 80 of Bihar STET 2025 Paper II Computer Science PYQ, 3 Nov 2025, Shift 1 (9:00 AM). See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.