Computer Science · Greedy Algorithms
Consider an instance of the Fractional Knapsack Problem: Number of items n = 3 Knapsack capacity W = 20 Profits (P1, P2, P3) = (25, 24, 15) Weights (w1, w2, w3) = (18, 15, 10) Which of the following feasible solutions gives the maximum profit?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1(1/2, 1/3, 1/4)
- 2(1, 2/15, 0)
- 3(0, 2/3, 1)
- 4(0, 1, 1/2)✓
Correct answer
(0, 1, 1/2)
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!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Greedy Algorithms MCQs →Want more practice questions on Greedy Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Greedy Algorithms