M

Mr. Dubey • 100.69K 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
Share
Explanation by: Mr. Dubey
brute force, recursion and dynamic programming can be used to find the submatrix that has the maximum sum.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. Internet Key Exchange has .... phases and modes of operations

Q. Which of the following scenarios leads to linear running time for a random search hit in a linear-probing hash table?

Q. Which of the following is an open source software?

Q. Hierarchical agglomerative clustering is typically visualized as?

Q. ........... happens when defect introduced in one phase passes to another phase without getting caught in the phase-end veriļ¬cation or validation ac

Q. Relational Algebra is

Q. In general, which of the following methods isn’t used to find the factorial of a number?

Q. In protocol the information is directly written into the main memory.

Q. Represent statement into predicate calculus forms : "Some men are not giants." Let us assume the following predicates man(x): “x is Ma

Q. Configuration Management Plan describes the Configuration Management procedures and structures to be used.

Question analytics