M

Mr. Dubey • 97.30K 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.

Loading Comments....

Related MCQs

Q. The decimal equivalent of the binary number (1011.011)2 is

Q. Which of the following is the principle of Golay cell which is used as a detector in IR spectroscopy?

Q. Waterfall model is basically a model in which each step must be completed before the next step can be started

Q. XML tag which represents information related to a REST service request.

Q. In operating system, each process has its own

Q. Site of Beta testing is

Q. Which of the following is not the feature of Network management systems?

Q. A good rule of thumb for determining the pin numbers of dual-in-line package IC chips would be to place the notch to your right and pin #1 will always

Q. DHCP (dynamic host configuration protocol) provides _____ to the client.

Q. Which of the following should be placed in second lowermost layer for the following figure?

Question analytics