- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- The main time taking step in fractional ...

Q. |
## The main time taking step in fractional knapsack problem is |

A. | breaking items into fraction |

B. | adding items into knapsack |

C. | sorting |

D. | looping through sorted items |

Answer» C. sorting | |

Explanation: the main time taking step is to sort the items according to their value/weight ratio. it defines the time complexity of the code. |

View all MCQs in:
Design and Analysis of Algorithms

- 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.
- Time complexity of fractional knapsack problem is
- Fractional knapsack problem can be solved in time O(n).
- Fractional knapsack problem is also known as
- Fractional knapsack problem is solved most efficiently by which of the following algorithm?
- The Knapsack problem is an example of
- Which of the following problems is equivalent to the 0-1 Knapsack problem?
- 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