Fractional Knapsack Problem MCQ Online Practice Test

1. Given the items as {value, weight} pairs {{80,20}, {60,30}, {40,10}}. If the knapsack capacity is 40, what is the maximum value for the fractional and 0/1 (non-fractional) knapsack problems, respectively?

140, 120

150, 140

160, 120

140, 100

2. What is another name for the fractional knapsack problem?

0/1 knapsack problem

Continuous knapsack problem

Divisible knapsack problem

Bounded knapsack problem

3. Which algorithmic approach solves the fractional knapsack problem most efficiently?

Divide and conquer

Dynamic programming

Greedy algorithm

Branch and bound

4. What is the main objective of the knapsack problem?

Maximize total value in the knapsack

Minimize total value in the knapsack

Minimize number of items used

Minimize total weight in the knapsack

5. How do 0/1 knapsack and fractional knapsack problems differ?

Items divisible in 0/1, indivisible in fractional

Both problems are identical

0/1 uses brute force, fractional uses backtracking

Items indivisible in 0/1, divisible in fractional

6. What is the time complexity of the standard fractional knapsack algorithm?

O(n log n)

O(n)

O(2^n)

O(nW)

7. Can the fractional knapsack problem be solved in O(n) time?

Yes, using a weighted median algorithm

No, sorting is always required

Yes, but only for sorted input

No, minimum time is O(n log n)

8. Given items {60,10}, {100,20}, {120,30} and knapsack capacity 50, what is the maximum value if items are divisible?

220

240

180

260

9. How does the optimal value of fractional knapsack compare to 0/1 knapsack?

Always greater than or equal

Always less than or equal

Always equal

No fixed relationship

10. Which step takes the most time in the fractional knapsack algorithm?

Calculating value/weight ratios

Adding items to the knapsack

Sorting items by ratio

Looping through sorted items

11. Which technique lets fractional knapsack be solved in O(n) instead of O(n log n)?

Merge sort

Weighted median algorithm

Binary search

Depth-first search

Test Name:	Fractional Knapsack Problem
Subject Category:	Design & Analysis of Algorithms
Test Type:	Multiple Choice Questions
Total Score / Questions:	11 / 11
Time Allowed:	5 Min
Who Should Practice this Test:	Students, job seekers, or professionals preparing for competitive exams and interviews.

Fractional Knapsack Problem MCQ Online Practice Test Quiz