Dynamic Programming MCQ

Test your knowledge with important Dynamic Programming MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Dynamic Programming MCQs at Bissoy

• Which of the following problems should be solved using dynamic programming?
  ক

  Mergesort

  খ

  Binary search

  গ

  Longest common subsequence

  ঘ

  Quicksort
• Which of the following problems is NOT solved using dynamic programming?
  ক

  0/1 knapsack problem

  খ

  Matrix chain multiplication problem

  গ

  Edit distance problem

  ঘ

  Fractional knapsack problem
• When a top-down approach of dynamic programming is applied to a problem, it usually _____________
  ক

  Decreases both, the time complexity and the space complexity

  খ

  Decreases the time complexity and increases the space complexity

  গ

  Increases the time complexity and decreases the space complexity

  ঘ

  Increases both, the time complexity and the space complexity
• In dynamic programming, the technique of storing the previously calculated values is called ___________
  ক

  Saving value property

  খ

  Storing value property

  গ

  Memoization

  ঘ

  Mapping
• A greedy algorithm can be used to solve all the dynamic programming problems.
  ক

  True

  খ

  False
• When dynamic programming is applied to a problem, it takes far less time as compared to other methods that don’t take advantage of overlapping subproblems.
  ক

  True

  খ

  False
• If a problem can be solved by combining optimal solutions to non-overlapping problems, the strategy is called _____________
  ক

  Dynamic programming

  খ

  Greedy

  গ

  Divide and conquer

  ঘ

  Recursion
• If a problem can be broken into subproblems which are reused several times, the problem possesses ____________ property.
  ক

  Overlapping subproblems

  খ

  Optimal substructure

  গ

  Memoization

  ঘ

  Greedy
• If an optimal solution can be created for a problem by constructing optimal solutions for its subproblems, the problem possesses ____________ property.
  ক

  Overlapping subproblems

  খ

  Optimal substructure

  গ

  Memoization

  ঘ

  Greedy
• Which of the following is/are property/properties of a dynamic programming problem?
  ক

  Optimal substructure

  খ

  Overlapping subproblems

  গ

  Greedy approach

  ঘ

  Both optimal substructure and overlapping subproblems