Knapsack problem

What is the other term for Knapsack?

• rucksuck problem
• rucksack prablem
• rucksack problem
• racksack problem

A mathematician who discovered the "Knapsack Problem" in 1884-1956.

• Tobias Danzig
• Tomas Dantzig
• Tobas Dantsig
• Tobias Dantzig

What are the two ways to solve a knapsack problem?

• Approximation algorithms and Meet-in-the-middle
• Greedy algorithm and Approximation algorithms
• Greedy algorithm and Dynamic programming
• 0/1 knapsack problem and Meet-in-the-middle

To solve the density, what formula will you use?

• Density = (value/weight)
• Density = (weight/value)
• Density = (item/value)
• Density = (value/item)

How to compute the Benefit?

• Benefit = (wt) x (tv of the item/tw of the item)
• Benefit = (tw) x (tw of the item/tv of the item)
• Benefit = (tw) x (tv of the item/tw of the item)
• Benefit = (wt) x (tw of the item/tv of the item)

What would be the value of [4,1]?

• 0
• 40
• 20
• 100

If we only take 1/3 of i3 what would be the total benefit?

• 22.000
• 22.322
• 22.111
• 22.333

In the greedy algorithm do we need to arrange the item by density in a descending order?

• True
• False

What would be the value of V[1,5]?

• 100
• 140
• 120
• 160

What items are selected to be put in the knapsack?

• 2 and 3
• 4 and 1
• 3 and 4
• 1 and 3