MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 4 Mcqs, each offering curated multiple-choice questions to sharpen your Matrix Multiplication using Recursion Multiple Choice knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Is Coppersmith-Winograd algorithm better than Strassen s algorithm in terms of time complexity? |
| A. | True |
| B. | False |
| Answer» B. False | |
| 2. |
What is the time complexity of the fastest known matrix multiplication algorithm? |
| A. | O(n<sup>log7</sup>) |
| B. | O(n<sup>2.37</sup>) |
| C. | O(n<sup>3</sup>) |
| D. | O(n!) |
| Answer» C. O(n<sup>3</sup>) | |
| 3. |
How many recursive calls are there in Recursive matrix multiplication by Strassen s Method? |
| A. | 5 |
| B. | 7 |
| C. | 8 |
| D. | 4 |
| Answer» C. 8 | |
| 4. |
What is the time complexity of matrix multiplied recursively by Strassen s Method? |
| A. | O(n<sup>log7</sup>) |
| B. | O(n<sup>2</sup>) |
| C. | O(n<sup>3</sup>) |
| D. | O(n!) |
| Answer» B. O(n<sup>2</sup>) | |