Strassen's Algorithm Multiple choice Questions and Answers (MCQs)
Click on any option to know the CORRECT ANSWERS
Strassen's algorithm is a/an..... algorithm.
Question 1 Explanation:
Strassen's Algorithm for matrix multiplication is a recursive algorithm since the present output depends on previous outputs and inputs.
What is the running time of Strassen's algorithm for matrix multiplication?
Question 2 Explanation:
Strassen's matrix algorithm requires only 7 recursive multiplications of n/2 x n/2 matrix and Theta(n2) scalar additions and subtractions yielding the running time as O(n2.81).
What is the running time of naive matrix multiplication algorithm?
Question 3 Explanation:
The traditional matrix multiplication algorithm takes O(n3) time. The number of recursive multiplications involved in this algorithm is 8.
Strassen's matrix multiplication algorithm follows ..... technique.
Divide and Conquer
Question 4 Explanation:
Strassen's matrix multiplication algorithm follows divide and conquer technique. In this algorithm the input matrices are divided into n/2 x n/2 sub matrices and then the recurrence relation is applied.
The number of scalar additions and subtractions used in Strassen's matrix multiplication algorithm is .....
Question 5 Explanation:
Using Theta(n2) scalar additions and subtractions, 14 matrices are computed each of which is n/2 x n/2. Then seven matrix products are computed recursively.
There are 5 questions to complete.