MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 9 Mcqs, each offering curated multiple-choice questions to sharpen your General Awareness knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Strassen’s algorithm is quite numerically stable as the naïve method. |
| A. | True |
| B. | False |
| Answer» C. | |
| 2. |
Strassen’s Matrix Algorithm was proposed by _____________ |
| A. | Volker Strassen |
| B. | Andrew Strassen |
| C. | Victor Jan |
| D. | Virginia Williams |
| Answer» B. Andrew Strassen | |
| 3. |
Who discussed techniques for reducing the memory requirements for Strassen’s algorithm? |
| A. | Strassen |
| B. | Lederman |
| C. | Bailey |
| D. | Higham |
| Answer» D. Higham | |
| 4. |
What is the recurrence relation used in Strassen’s algorithm? |
| A. | 7T(n/2) + Theta(n2) |
| B. | 8T(n/2) + Theta(n2) |
| C. | 7T(n/2) + O(n2) |
| D. | 8T(n/2) + O(n2) |
| Answer» B. 8T(n/2) + Theta(n2) | |
| 5. |
Running time of Strassen’s algorithm is better than the naïve Theta(n3) method. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 6. |
The number of scalar additions and subtractions used in Strassen’s matrix multiplication algorithm is ________ |
| A. | O(n2.81) |
| B. | Theta(n2) |
| C. | Theta(n) |
| D. | O(n3) |
| Answer» C. Theta(n) | |
| 7. |
Strassen’s matrix multiplication algorithm follows ___________ technique. |
| A. | Greedy technique |
| B. | Dynamic Programming |
| C. | Divide and Conquer |
| D. | Backtracking |
| Answer» D. Backtracking | |
| 8. |
What is the running time of Strassen’s algorithm for matrix multiplication? |
| A. | O(n2.81) |
| B. | O(n3) |
| C. | O(n1.8) |
| D. | O(n2) |
| Answer» B. O(n3) | |
| 9. |
Strassen’s algorithm is a/an_____________ algorithm. |
| A. | Non- recursive |
| B. | Recursive |
| C. | Approximation |
| D. | Accurate |
| Answer» C. Approximation | |