Algorithms · Question 13 · Hard
Algorithms question 13
A 0/1 knapsack has capacity 7 kg. The items (weight, value) are: (1 kg, ₹1), (3 kg, ₹4), (4 kg, ₹5), (5 kg, ₹7). What is the maximum total value that fits?
- ₹9
- ₹8
- ₹10
- ₹12
Answer and explanation
Answer: A. ₹9
Explanation: The best choice is the 3 kg and 4 kg items: weight 7, value 4 + 5 = 9. The 5 kg item can only pair with the 1 kg item (value 8), and 5 + 7 = 12 would need 9 kg.
Previous: What is the length of the Longest Common Subsequence (LCS) of the strings… · Next: For the naive recursive Fibonacci function below, how many times is fib called…
Practise algorithms
Try a fresh set of algorithms questions with an explanation after every answer, free and without signing up: Algorithms practice. Or sit a full placement mock test.
More algorithms questions
- Coins of value ₹1, ₹3 and ₹4 are available in unlimited supply. A greedy…
- Insertion sort is applied to [5, 2, 4, 6, 1, 3]. What does the array look like…
- What is the length of the Longest Common Subsequence (LCS) of the strings…
- For the naive recursive Fibonacci function below, how many times is fib called…
- Using the Master theorem, what is the solution of T(n) = 3T(n/2) + n?
- What is the best-case time complexity of linear search on an array of n…
- Which of the following sorting algorithms is stable in its standard…
- Which algorithm finds single-source shortest paths correctly even when some…
- What is the worst-case time complexity of merge sort on n elements?
- What is the time complexity of finding the largest element in an unsorted…
More technical & programming practice
Object-Oriented Programming · DBMS · SQL · Operating Systems · Computer Networks · Software Engineering · Cloud & DevOps · GenAI Basics
LogicWiz Exams home · All practice topics · Placement mock tests · Daily 10 challenge