What data structure is commonly used to sort items by value-to-weight ratio?
ALinked list without sorting
BQueue
CStack
DArray or list
✗ Incorrect
Arrays or lists are sorted by ratio to apply the greedy approach.
If the knapsack capacity is 50 and the next item weight is 30, but only 20 capacity remains, what do you do?
ATake the full item anyway
BSkip the item
CTake 20/30 fraction of the item
DRemove some items already taken
✗ Incorrect
Take the fraction of the item that fits in the remaining capacity.
Explain the greedy approach to solving the Fractional Knapsack Problem step-by-step.
Think about how to fill the knapsack with the most valuable parts first.
You got /4 concepts.
Describe the difference between Fractional Knapsack and 0/1 Knapsack problems and why the greedy method works for one but not the other.
Focus on item divisibility and algorithm choice.
You got /3 concepts.
Practice
(1/5)
1. What is the main goal of the Fractional Knapsack Problem?
easy
A. Maximize number of items regardless of weight
B. Maximize total value by taking fractions of items within weight limit
C. Minimize total weight by selecting whole items only
D. Select items randomly without considering value or weight
Solution
Step 1: Understand the problem goal
The fractional knapsack problem allows taking parts of items to maximize total value within a weight limit.
Step 2: Compare options
Only Maximize total value by taking fractions of items within weight limit correctly states maximizing total value by taking fractions within weight limit.
Final Answer:
Maximize total value by taking fractions of items within weight limit -> Option B
Quick Check:
Goal = Maximize value with fractions [OK]
Hint: Remember: fractional means partial items allowed [OK]
Common Mistakes:
Thinking only whole items can be taken
Confusing with minimizing weight
Ignoring value-to-weight ratio
2. Which C# syntax correctly declares a class named Item with public fields weight and value?
easy
A. class Item { public int weight; public int value; }
B. class Item { int weight; int value; }
C. public Item { int weight; int value; }
D. class Item { public weight; public value; }
Solution
Step 1: Check class declaration syntax
In C#, class fields must have type and access modifier for public fields.
Step 2: Validate each option
class Item { public int weight; public int value; } correctly declares public int fields. class Item { int weight; int value; } lacks access modifier. public Item { int weight; int value; } misses class keyword. class Item { public weight; public value; } misses types.
Final Answer:
class Item { public int weight; public int value; } -> Option A
Quick Check:
Correct class syntax = class Item { public int weight; public int value; } [OK]
Hint: Public fields need type and access modifier [OK]
Common Mistakes:
Omitting access modifiers
Missing data types
Incorrect class keyword usage
3. What is the output of this C# code snippet for fractional knapsack?
var items = new[] {
new Item { weight = 10, value = 60 },
new Item { weight = 20, value = 100 },
new Item { weight = 30, value = 120 }
};
int capacity = 50;
double maxValue = 0;
Array.Sort(items, (a, b) => (b.value / (double)b.weight).CompareTo(a.value / (double)a.weight));
int remaining = capacity;
foreach (var item in items) {
if (item.weight <= remaining) {
maxValue += item.value;
remaining -= item.weight;
} else {
maxValue += item.value * (remaining / (double)item.weight);
break;
}
}
Console.WriteLine(Math.Round(maxValue, 2));
Take Item1 fully (weight 10, value 60), remaining=40. Take Item2 fully (weight 20, value 100), remaining=20. Take 20/30 fraction of Item3: value = 120 * (20/30) = 80.
Step 3: Calculate total value
Total = 60 + 100 + 80 = 240. Rounded to 240.00.
Final Answer:
240.00 -> Option D
Quick Check:
Sum values with fractions = 240.00 [OK]
Hint: Sort by value/weight, take full then fraction [OK]
Common Mistakes:
Not sorting by value/weight ratio
Taking items without fraction
Incorrect fraction calculation
4. Identify the bug in this fractional knapsack code snippet:
int capacity = 50;
var items = new List<Item> {
new Item { weight = 10, value = 60 },
new Item { weight = 20, value = 100 },
new Item { weight = 30, value = 120 }
};
items.Sort((a, b) => (a.value / a.weight).CompareTo(b.value / b.weight));
double maxValue = 0;
int remaining = capacity;
foreach (var item in items) {
if (item.weight <= remaining) {
maxValue += item.value;
remaining -= item.weight;
} else {
maxValue += item.value * (remaining / item.weight);
break;
}
}
Console.WriteLine(maxValue);
medium
A. Sorting order is ascending instead of descending
B. Missing check for zero weight items
C. Integer division causes incorrect ratio calculation
D. Using List instead of array causes error
Solution
Step 1: Analyze sorting comparator
The comparator uses integer division (a.value / a.weight) which truncates decimals, causing wrong ratios.
Step 2: Impact on sorting and calculation
Integer division leads to incorrect sorting order and wrong maxValue calculation.
Final Answer:
Integer division causes incorrect ratio calculation -> Option C
Quick Check:
Use double division for correct ratios [OK]
Hint: Use double division for ratios, not integer division [OK]
Common Mistakes:
Sorting ascending instead of descending
Ignoring integer division truncation
Assuming List causes error
5. Given items with weights and values: [(5, 30), (10, 40), (15, 45)], and knapsack capacity 20, what is the maximum value achievable using fractional knapsack?