ObjectiveMcq
Print Protected
This page is protected for print. Use the website to view the content.
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?
Correct Answer: D — Exponential
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.