- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Consider the 2×3 matrix {{1,2,3},{1,2,3}...

Q. |
## Consider the 2×3 matrix {{1,2,3},{1,2,3}}. What is the sum of elements of the maximum sum rectangle? |

A. | 3 |

B. | 6 |

C. | 12 |

D. | 18 |

Answer» C. 12 | |

Explanation: since all the elements of the 2×3 matrix are positive, the maximum sum rectangle is the matrix itself and the sum of elements is 12. |

View all MCQs in:
Design and Analysis of Algorithms

- Consider the 2×2 matrix {{-1,-2},{-3,-4}}. What is the sum of elements of the maximum sum rectangle?
- In which of the following cases, the maximum sum rectangle is the 2D matrix itself?
- Matrix A is of order 3*4 and Matrix B is of order 4*5. How many elements will be there in a matrix A*B multiplied recursively.
- If Matrix X is of order A*B and Matrix Y is of order C*D, and B=C then the order of the Matrix X*Y is A*D?
- The dynamic programming implementation of the maximum sum rectangle problem uses which of the following algorithm?
- Given a 2D matrix, find a submatrix that has the maximum sum. Which of the following methods can be used to solve this problem?
- What is the worst case time complexity of dynamic programming solution of set partition problem(sum=sum of set elements)?
- What will be the auxiliary space complexity of dynamic programming solution of set partition problem(sum=sum of set elements)?
- Consider the graph M with 3 vertices. Its adjacency matrix is shown below. Which of the following is true?
- Given an array, check if the array can be divided into two subsets such that the sum of elements of the two subsets is equal. This is the balanced partition problem. Which of the following methods can be used to solve the balanced partition problem?

Login to Continue

It will take less than 2 minutes

Report MCQ