Computer Science · Algorithms
फ्रैक्शनल नैपसैक समस्या (fractional knapsack problem) के लिए ग्रीडी एल्गोरिथम (greedy algorithm) किसके आधार पर वस्तुओं का चयन करता है?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1रैंडम चयन
- 2पहले न्यूनतम लागत
- 3पहले कुल भार
- 4अवरोही क्रम में मूल्य-से-भार का अनुपात (Value-to-weight ratio)✓
सही उत्तर देखें
अवरोही क्रम में मूल्य-से-भार का अनुपात (Value-to-weight ratio)
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