Computer Science · Algorithms
The greedy algorithm for the fractional knapsack problem selects items based on:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Value-to-weight ratio in descending order✓
- 2Total weight first
- 3Least cost first
- 4Random selection
Correct answer
Value-to-weight ratio in descending order
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 Algorithms MCQs →Want more practice questions on Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Algorithms