1.
Which line will complete the ABOVE code?
A
prices[j-1] + max_val[tmp_idx]
B
prices[j] + max_val[tmp_idx]
C
prices[j-1] + max_val[tmp_idx - 1]
D
prices[j] + max_val[tmp_idx - 1]
Loading practice questions
7 practice sets · Page 1 of 1
Which line will complete the ABOVE code?
prices[j-1] + max_val[tmp_idx]
prices[j] + max_val[tmp_idx]
prices[j-1] + max_val[tmp_idx - 1]
prices[j] + max_val[tmp_idx - 1]
For every rod cutting problem there will be a unique set of pieces that give the maximum price.
True
False
Complete the above code.
max_price, prices[i] + rod_cut(prices,len - i - 1)
max_price, prices[i - 1].
max_price, rod_cut(prices, len - i - 1)
max_price, prices[i - 1] + rod_cut(prices,len - i - 1)
Which of these pieces give the maximum price?
{1,2,7}
{10}
{2,2,6}
{1,4,5}
Consider the brute force implementation of the rod cutting problem in which all the possible cuts are found and the maximum value is calculated. What is the time complexity of this brute force implementation?
O(n^{2})
O(n^{3})
O(nlogn)
O(2^{n})
What is the maximum value that you can get after cutting the rod and selling the pieces?
10
11
12
13
Given a rod of length n and the selling prices of all pieces smaller than equal to n, find the most beneficial way of cutting the rod into smaller pieces. This problem is called the rod cutting problem. Which of these methods can be used to solve the rod cutting problem?
Brute force
Dynamic programming
Recursion
Brute force, Dynamic programming and Recursion