Dynamic Programming Mcqs

Our collections of Multiple choice questions and answers focuses on study of ” Dynamic Programming ” in Data Structures. These questions are chosen from a collection of most authoritative and best reference books on Data Structures. Our aim is to prepare an individual for competitive exams like NTS | GAT | ECAT | Data Warehouse jobs | Data Mining | DB administration jobs Software House and Computer Programmer jobs | University and College entrance exams and various tests and job interviews. One should practice our Mcqs to assimilate knowledge on Dynamic Programming comprehensively.

  1. Home
  2. »
  3. Computer Science Mcqs
  4. »
  5. Data Structures Mcqs
  6. »
  7. Dynamic Programming Mcqs
  8. »
  9. Page 11

Computer MCQS

Sciences MCQS

151.
You are given infinite coins of denominations v1, v2, v3,…..,vn and a sum S. The coin change problem is to find the minimum number of coins required to get the sum S. This problem can be solved using ____________

Greedy algorithm

Dynamic programming

Divide and conquer

All of the mentioned

Answer Discus (0)

152.
You are given infinite coins of N denominations v1, v2, v3,…..,vn and a sum S. The coin change problem is to find the minimum number of coins required to get the sum S. What is the time complexity of a dynamic programming implementation used to solve the coin change problem?

O(N)

O(S)

O(N^2)

O(S*N)

Answer Discus (0)

Engineering MCQS

General Subjects MCQS

0Shares
0
Scroll to Top