Embercode: AI-powered software engineer course

1. What number does this program print? ``

python
weights = [3]
values = [4]
capacity = 7
best = [0] * (capacity + 1)
for w in range(1, capacity + 1):
    for i in range(len(weights)):
        if weights[i] <= w:
            best[w] = max(best[w], best[w - weights[i]] + values[i])
print(best[capacity])

``

46812

2. What is the last line printed by this program? ``

python
weights = [2]
values = [5]
capacity = 5
best = [0] * (capacity + 1)
for w in range(capacity, 0, -1):
    for i in range(len(weights)):
        if weights[i] <= w:
            best[w] = max(best[w], best[w - weights[i]] + values[i])
print(best)
print(best[capacity])

``

51020

3. Why does the unbounded knapsack loop let the same item be taken more than once?

The loop skips any item that was already used at a smaller capacityPython resets the list to zero at each capacity, so earlier items are forgottenThe items are sorted by weight before the loop startsWhen best[w - weights[i]] is read, that entry is already final and may already include item i

4. The rod cutting prices from the lesson are: length 1 sells for 1, length 2 for 5, length 3 for 8, length 4 for 9, and length 5 for 10. What is the best total for a rod of length 5?

10131115

5. Using the lesson's rod prices (length 1 for 1, 2 for 5, 3 for 8, 4 for 9, 5 for 10, 6 for 17, 7 for 17, 8 for 20), what is the best total for a rod of length 8?

Type your answer.

Unbounded knapsack