Which of the following problems is equivalent to the 0-1 Knapsack problem?
Correct Answer: you are studying for an exam and you have to study n questions. the questions take {t1, t2, t3,…., tn} time(in hours) and carry {m1, m2, m3,…., mn} marks. you can study for a maximum of t hours. you can either study a question or leave it. c
Make the most of this question
This page focuses on one Design and Analysis of Algorithms question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.
WhatsApp+91 99922 70404Design and Analysis of Algorithms MCQ: Which of the following problems is equivalent to the 0-1 Knapsack problem? | Extra Education
