UTpaper

Free mock tests & test series

Question 16Asked in Bihar STET Paper 2 Computer Science (Class 11-12), 12 Sep 2023, Shift 2

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 uses dynamic programming because an optimal tree's left and right subtrees must themselves be optimal (optimal substructure), with overlapping subproblems reused from a table.

From Bihar STET Paper 2 Computer Science (Class 11-12) PYQ, 12 Sep 2023, Shift 2

This is question 16 of Bihar STET Paper 2 Computer Science (Class 11-12) PYQ, 12 Sep 2023, Shift 2. 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.