Vidyalelo
Data Structure · Q97

Dynamic Programming in Data Structures

Programming · Data Structure · question 97

Q97

Which of the following methods can be used to solve the matrix chain multiplication problem?

A.
Dynamic programming
B.
Brute force
C.
Recursion
D.
Dynamic Programming, Brute force, Recursion
Answer

Answer: Option D

Solution

Answer: Option D
No explanation is given for this question Let's Discuss on Board