Computer Science · Dynamic Programming
For the 0/1 knapsack problem with capacity 4 and three items: Item 1 (weight = 3, value = 25), Item 2 (weight = 2, value = 20), and Item 3 (weight = 1, value = 15), what is the maximum value obtained using dynamic programming?
- 155
- 250
- 345✓
- 440
Correct answer
45
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Want more practice questions on Dynamic Programming?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Dynamic Programming