M

Mr. Dubey • 100.69K Points
Coach

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!)
Share
Explanation by: Mr. Dubey
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.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. What is the difference between a D latch and a D flip-flop?

Q. Why must CMOS devices be handled with care?

Q. Both ping and tracert are used to find If the computer is in the network.

Q. In stack, to display the lastly inserted element without removing it, which function is used?

Q. Which type of Hypervisor is shown in the following figure?

Q. In ASP.NET application the Global.asax file lie in which directory

Q. Which type of data file is analogous to an audio cassette tape?

Q. Advantage of Decentralised IT management system is

Q. What will be the output of the following Python code snippet? a = [0, 1, 2, 3] for a[0] in a: print(a[0])

Q. Why is man command used

Question analytics