Help authour, Buy PDF Ebook >>>Click Here<<<
Matrix Multiplication using Recursion Multiple choice Questions and Answers (MCQs)
Click on any option to know the CORRECT ANSWERS
Question 1 |
If Matrix A is of order X*Y and Matrix B is of order M*N, then what is the order of the Matrix A*B given that Y=M?
Y*N | |
X*M | |
X*N | |
Y*M |
Question 1 Explanation:
The Matrix A*B is of order X*N as it is given that Y=M i.e. number of columns in Matrix A is equal to total number of rows in matrix B. So the Matrix A*B must have X number of rows and N number of columns.
Question 2 |
How many recursive calls are there in Recursive matrix multiplication through Simple Divide and Conquer Method?
2 | |
6 | |
9 | |
8 |
Question 2 Explanation:
For the multiplication two square matrix recursively using Simple Divide and Conquer Method, there are 8 recursive calls performed for high time complexity.
Question 3 |
What is the time complexity of matrix multiplied recursively by Divide and Conquer Method?
O(n) | |
O(n2) | |
O(n3) | |
O(n!) |
Question 3 Explanation:
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.
Question 4 |
What is the time complexity of matrix multiplied recursively by Strassen's Method?
O(nlog7) | |
O(n2) | |
O(n3) | |
O(n!) |
Question 4 Explanation:
The time complexity of recursive multiplication of two square matrices by Strassen's Method is found to be O(nlog7) since there are total 7 recursive calls.
Question 5 |
How many recursive calls are there in Recursive matrix multiplication by Strassen's Method?
5 | |
7 | |
8 | |
4 |
Question 5 Explanation:
For the multiplication two square matrix recursively using Strassen's Method, there are 7 recursive calls performed for high time complexity.
There are 5 questions to complete.