- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Which of the following statement about 0...

Q. |
## Which of the following statement about 0/1 knapsack and fractional knapsack problem is correct? |

A. | in 0/1 knapsack problem items are divisible and in fractional knapsack items are indivisible |

B. | both are the same |

C. | 0/1 knapsack is solved using a greedy algorithm and fractional knapsack is solved using dynamic programming |

D. | in 0/1 knapsack problem items are indivisible and in fractional knapsack items are divisible |

Answer» D. in 0/1 knapsack problem items are indivisible and in fractional knapsack items are divisible | |

Explanation: in fractional knapsack problem we can partially include an item into the knapsack whereas in 0/1 knapsack we have to either include or exclude the item wholly. |

View all MCQs in:
Design and Analysis of Algorithms

- The result of the fractional knapsack is greater than or equal to 0/1 knapsack.
- Fractional knapsack problem is solved most efficiently by which of the following algorithm?
- Fractional knapsack problem is also known as
- Time complexity of fractional knapsack problem is
- Fractional knapsack problem can be solved in time O(n).
- The main time taking step in fractional knapsack problem is
- Which of the following problems is equivalent to the 0-1 Knapsack problem?
- The Knapsack problem is an example of
- The 0-1 Knapsack problem can be solved using Greedy algorithm.
- What is the objective of the knapsack problem?

Login to Continue

It will take less than 2 minutes

Report MCQ