# MCQ IN COMPUTER SCIENCE & ENGINEERING

## COMPUTER SCIENCE AND ENGINEERING

### ALGORITHMS

 Question [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Fractional knapsack is based on ____ method
 A Greedy B Branch and Bound C Dynamic Programming D Divide and Conquer
Explanation:

Detailed explanation-1: -The fractional Knapsack problem using the Greedy Method is an efficient method to solve it, where you need to sort the items according to their ratio of value/weight. In a fractional knapsack, we can break items to maximize the knapsackâ€™s total value.

Detailed explanation-2: -Efficient Approach(Greedy) The Fractional Knapsack problem can be solved efficiently using the greedy algorithm, where you need to sort the items according to their value/weight ratio.

Detailed explanation-3: -The Greedy algorithm could be understood very well with a well-known problem referred to as Knapsack problem. Although the same problem could be solved by employing other algorithmic approaches, Greedy approach solves Fractional Knapsack problem reasonably in a good time.

There is 1 question to complete.