What is the time complexity of matrix multiplied recursively by Divide and Conquer Method?

Home / Engineering / Design and Analysis of Algorithms / Question

Mr. Dubey • 51.43K Points
Coach

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

(A) o(n)

(B) o(n2)

(D) o(n!)

Correct answer : Option (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.

Discusssion

Related MCQs on Design and Analysis of Algorithms

Q. What is the key size allowed in PGP?

Q. What type of review requires formal entry and exit criteria, including metrics?

Q. Which of the following architectural standards is working with cloud computing industry?

Q. ______dataset with many features contains information proportional to the independence of all features and their variance.

Q. ___________________ initializes each private copy with the corresponding value from the master thread.

Q. Down sampling is to make a digital image file smaller by

Q. During software development, which factor is most crucial?

Q. An activity which must be completed before one or more other activities start is known as ……….activity.

Q. The decimal equivalent of Binary number 10101 is

Q. Decision Tree is