[Solved] How many recursive calls are there in Recursive matrix multiplication by Strassen’s Method?

Computer Science Engineering (CSE)
Design and Analysis of Algorithms
How many recursive calls are there in Re...

Q.	How many recursive calls are there in Recursive matrix multiplication by Strassen’s Method?
A.	5
B.	7
C.	8
D.	4
Answer» B. 7
Explanation: for the multiplication two square matrix recursively using strassen’s method, there are 7 recursive calls performed for high time complexity.

View all MCQs in: Design and Analysis of Algorithms

Discussion

Related Questions

Matrix A is of order 3*4 and Matrix B is of order 4*5. How many elements will be there in a matrix A*B multiplied recursively.
If Matrix X is of order A*B and Matrix Y is of order C*D, and B=C then the order of the Matrix X*Y is A*D?
Which of the following methods can be used to solve the matrix chain multiplication problem?
What is the time complexity of matrix multiplied recursively by Divide and Conquer Method?
Which of the following recursive formula can be used to find the factorial of a number?
What is the time complexity of the above recursive implementation used to reverse a string?
What will be the recurrence relation of the code of recursive selection sort?
What will be the best case time complexity of recursive selection sort?
Recursive selection sort is a comparison based sort.
What is the average case time complexity of recursive selection sort?