Embercode: AI-powered software engineer course

1. What does this program print? ``

cpp
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

int main() {
    vector<int> w = {2, 5}, v = {3, 7};
    int cap = 9;
    vector<int> dp(cap + 1, 0);
    for (int i = 0; i < 2; i++)
        for (int c = w[i]; c <= cap; c++)
            dp[c] = max(dp[c], dp[c - w[i]] + v[i]);
    cout << dp[cap] << endl;
}

``

9121316

2. What does this program print? ``

cpp
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

int main() {
    vector<int> price = {0, 1, 3, 4};
    int n = 6;
    vector<int> best(n + 1, 0);
    for (int piece = 1; piece <= 3; piece++)
        for (int len = n; len >= piece; len--)
            best[len] = max(best[len], best[len - piece] + price[piece]);
    cout << best[n] << endl;
}

``

68912

3. In the rod-cutting program, what does first[len] store?

The length of the first piece in one best way to cut a rod of length lenThe value of the best cut for length lenThe number of pieces in the best cutThe price of the piece of length len

4. Which statement about the 0/1 knapsack loop and the unbounded knapsack loop is true?

The unbounded loop takes O(capacity^2) time per item, so it is slowerThe 0/1 loop is faster because it skips cellsThe downward loop reuses items, so it is slower to find the answerBoth loops take O(capacity) time per item, and only the direction changes the answer

5. For an unbounded knapsack, which way does the capacity loop run? Answer with one word.

Type your answer.

Unbounded knapsack