**DOWNLOAD FREE PDF** **<<CLICK HERE>>**

## Matrix Multiplication using Recursion Multiple choice Questions and Answers (MCQs)

Congratulations - you have completed *Matrix Multiplication using Recursion Multiple choice Questions and Answers (MCQs)*.

You scored %%SCORE%% out of %%TOTAL%%.

Your performance has been rated as %%RATING%%

Your answers are highlighted below.

Question 1 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER] |

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 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER] |

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 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER] |

What is the time complexity of matrix multiplied recursively by Divide and Conquer Method?

O(n) | |

O(n ^{2}) | |

O(n ^{3}) | |

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(n

^{3}) since there are total of 8 recursive calls.

Question 4 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER] |

What is the time complexity of matrix multiplied recursively by Strassen's Method?

O(n ^{log7}) | |

O(n ^{2}) | |

O(n ^{3}) | |

O(n!) |

Question 4 Explanation:

The time complexity of recursive multiplication of two square matrices by Strassen's Method is found to be O(n

^{log7}) since there are total 7 recursive calls.Question 5 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER] |

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.

Once you are finished, click the button below. Any items you have not completed will be marked incorrect.

There are 5 questions to complete.