- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- What is the time complexity of matrix mu...

Q. |
## What is the time complexity of matrix multiplied recursively by Divide and Conquer Method? |

A. | o(n) |

B. | o(n2) |

C. | o(n3) |

D. | o(n!) |

Answer» C. o(n3) | |

Explanation: the time complexity of recursive multiplication of two square matrices by the divide and conquer method is found to be o(n3) since there are total of 8 recursive calls. |

View all MCQs in:
Design and Analysis of Algorithms

- 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.
- What is the space complexity of the divide and conquer algorithm used to find the maximum sub-array sum?
- What is the optimal time required for solving the closest pair problem using divide and conquer approach?
- In divide and conquer, the time is taken for merging the subproblems is?
- The optimal time obtained through divide and conquer approach using merge sort is the best case efficiency.
- What will be the time complexity of the code to reverse stack recursively?
- Quick sort follows Divide-and-Conquer strategy.
- What is the space complexity of program to reverse stack 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?
- Worst case is the worst case time complexity of Prim’s algorithm if adjacency matrix is used?

Login to Continue

It will take less than 2 minutes

Report MCQ