- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Fractional knapsack problem can be solve...

Q. |
## Fractional knapsack problem can be solved in time O(n). |

A. | true |

B. | false |

Answer» A. true | |

Explanation: it is possible to solve the problem in o(n) time by adapting the algorithm for finding weighted medians. |

View all MCQs in:
Design and Analysis of Algorithms

- Which of the following statement about 0/1 knapsack and fractional knapsack problem is correct?
- Fractional knapsack problem is solved most efficiently by which of the following algorithm?
- The result of the fractional knapsack is greater than or equal to 0/1 knapsack.
- Time complexity of fractional knapsack problem is
- The main time taking step in fractional knapsack problem is
- Fractional knapsack problem is also known as
- The 0-1 Knapsack problem can be solved using Greedy algorithm.
- The longest increasing subsequence problem is a problem to find the length of a subsequence from a sequence of array elements such that the subsequence is sorted in increasing order and it’s length is maximum. This problem can be solved using
- You are given infinite coins of denominations v1, v2, v3,…..,vn and a sum S. The coin change problem is to find the minimum number of coins required to get the sum S. This problem can be solved using
- In what time can the Hamiltonian path problem can be solved using dynamic programming?

Login to Continue

It will take less than 2 minutes

Report MCQ