Home / Engineering / Design and Analysis of Algorithms / Question

M

Mr. Dubey • 51.43K Points
Coach 

Q.) Given a 2D matrix, find a submatrix that has the maximum sum. Which of the following methods can be used to solve this problem?

(A) brute force
(B) recursion
(C) dynamic programming
(D) brute force, recursion, dynamic programming
Correct answer : Option (D) - brute force, recursion, dynamic programming

Explanation: 
 brute force, recursion and dynamic programming can be used to find the submatrix that has the maximum sum.

Share

Previous

Next

Discusssion

Login to discuss.

Related MCQs on Design and Analysis of Algorithms

Q. Who will use their own IoT business models?

Q. Which of the following has the capability to store the information permanently?

Q. It is a set of levels that defines a testing maturity hierarchy

Q. which of the following translate and execute programe statements in sequence, instead of having separate translation and execution steps ?

Q. Which are different sources of Overheads in Parallel Programs?

Q. The relation R defined on the set A = {1, 2, 3, 4, 5} by R = {(x, y) : x2 – y2 < 16} is given by

Q. Which of the following is not an area of concern in the design model?

Q. Signals can be analog or digital and a computer that processes the both type of signals is known as

Q. Which of the following conditions must hold for a solution to a CSP?

Q. The output current capability of a single 7400 NAND gate when HIGH is called