M

Mr. Dubey • 100.69K Points
Coach

Q. Consider the brute force implementation in which we find all the possible ways of multiplying the given set of n matrices. What is the time complexity of this implementation?

  • (A) o(n!)
  • (B) o(n3)
  • (C) o(n2)
  • (D) exponential
Share
Explanation by: Mr. Dubey
the time complexity of finding all the possible ways of multiplying a set of n matrices is given by (n-1)th catalan number which is exponential.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. The first computer introduced in Nepal was

Q. Which Statement is not true statement.

Q. The tar command in UNIX

Q. Bluetooth supports _______

Q. In prioritizing what to test, the most important objective is to:

Q. Which of the following umask settings doesn’t allow execute permission to be set by default on directory files

Q. Which command is used with vi editor to move the cursor to the left?

Q. Which of the following memories needs refresh?

Q. Give the correct Answer for following statements. 1. It is important to perform feature normalization before using the Gaussian kernel. 2. The maximum

Q. Depreciation available, if the asset is used for less than 180 days during the year of acquisition shall be of block rate:

Question analytics