Which property of dynamic programming is particularly useful for solving…

Bihar STET · PGT (Paper 2) · Computer Science · 2025

Which property of dynamic programming is particularly useful for solving Optimal Binary Search Tree problems?

A.
Optimal substructure
B.
Greedy choice property
C.
Divide and Conquer
D.
Linear programming

Attempted by 234 students.

Show answer

Correct answer: A

The worked solution is available to enrolled students.

Explore the full course: Bihar Stet Paper Ii Computer Science