- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Matrix A is of order 3*4 and Matrix B is...

Q. |
## 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. |

A. | 12 |

B. | 15 |

C. | 16 |

D. | 20 |

Answer» B. 15 | |

Explanation: the resultant matrix will be of order 3*5 when multiplied recursively and therefore the matrix will have 3*5=15 elements. |

View all MCQs in:
Design and Analysis of Algorithms

- What is the time complexity of matrix multiplied recursively by Divide and Conquer Method?
- 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?
- What is the space complexity of program to reverse stack recursively?
- What will be the time complexity of the code to reverse stack recursively?
- How many recursive calls are there in Recursive matrix multiplication by Strassen’s Method?
- Consider the 2×3 matrix {{1,2,3},{1,2,3}}. What is the sum of elements of the maximum sum rectangle?
- Consider the 2×2 matrix {{-1,-2},{-3,-4}}. What is the sum of elements of the maximum sum rectangle?
- The longest increasing subsequence problem is a problem to find the length of a subsequence from a sequence of array elements such that the subsequence is sorted in increasing order and it’s length is maximum. This problem can be solved using
- How many cases are there under Master’s theorem?
- 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