Aspire's Library
A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations - NIMCET
Study Stuff for MCA Examinations - NIMCET
Previous Year Question (PYQs)
When developing a dynamic programming algorithm, the sequence of steps followed is:
- A. Construct an optimal solution from computed information.
- B. Recursively define the value of an optimal solution.
- C. Characterize the structure of an optimal solution.
- D. Compute the value of an optimal solution, typically in a bottom-up fashion.
Choose the correct answer from the options given below:
- B, C, A, D
- B, A, C, D
- C, B, A, D
- C, B, D, A
Solution
Answer: (4) C, B, D, A
Explanation:
The standard steps for designing a dynamic programming algorithm are:
- (C) Characterize the structure of an optimal solution.
- (B) Recursively define the value of an optimal solution.
- (D) Compute the value of an optimal solution (usually bottom-up).
- (A) Construct the optimal solution from the computed information.
Hence, the correct order is C → B → D → A.
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
Ask Your Question or Put Your Review.
