Category Archives: Dynamic Programming MCQ

This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Fibonacci using Dynamic Programming”. 1. The following sequence is a fibonacci sequence: 0, 1, 1, 2, 3, 5, 8, 13, 21,….. Which technique can be used to get the nth fibonacci term? a) Recursion b) Dynamic programming c) A single for loop … Read more

This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Dynamic Programming”. 1. Which of the following is/are property/properties of a dynamic programming problem? a) Optimal substructure b) Overlapping subproblems c) Greedy approach d) Both optimal substructure and overlapping subproblems 2. If an optimal solution can be created for a problem by … Read more