Dynamic Programming In Data Structures - Study Mode
[#76] In which of the following cases, the maximum sum rectangle is the 2D matrix itself?
Correct Answer
(A) When all the elements are negative
[#77] Wagner-Fischer is a . . . . . . . . algorithm.
Correct Answer
(C) Dynamic programming
[#78] Consider the brute force implementation in which we find all the possible ways of multiplying the given set of n matrices. What is the time complexity of this implementation?
Correct Answer
(D) Exponential
[#79] Consider the following assembly line problem: time_to_reach[2][3] = {{17, 2, 7}, {19, 4, 9}}
time_spent[2][4] = {{6, 5, 15, 7}, {5, 10, 11, 4}}
entry_time[2] = {8, 10}
exit_time[2] = {10, 7}
num_of_stations = 4 For the optimal solution, which should be the exit assembly line?
Correct Answer
(B) Line 2
[#80] Which of the following implementations of Catalan numbers has the largest space complexity(Don't consider the stack space)?
Correct Answer
(A) Dynamic programming