Bissoy.com
Doctors Medicines MCQs Q&A

Fractional knapsack problem is solved most efficiently by which of the following algorithm?

Fractional knapsack problem is solved most efficiently by which of the following algorithm? Correct Answer Greedy algorithm

Greedy algorithm is used to solve this problem. We first sort items according to their value/weight ratio and then add item with highest ratio until we cannot add the next item as a whole. At the end, we add the next item as much as we can.

Related Questions

Which of the following statement about 0/1 knapsack and fractional knapsack problem is correct?
The result of the fractional knapsack is greater than or equal to 0/1 knapsack.
Fractional knapsack problem can be solved in time O(n).
Which of the following is a correct time complexity to solve the 0/1 knapsack problem where n and w represents the number of items and capacity of knapsack respectively?
A 0-1 knapsack problem has four items and knapsack capacity 11. The weight and profit of each item is given in below table. Pi (Rs.) 50 30 32 27    W = 11  Wi (Kg) 5 6 4 3 Which of the following greedy strategy gives the maximum profit?
A superincreasing knapsack problem is ____ to solve than a jumbled knapsack.
The 0-1 Knapsack problem can be solved using Greedy algorithm.
Fractional knapsack problem is also known as __________
Time complexity of fractional knapsack problem is ____________
The main time taking step in fractional knapsack problem is ___________