## Buy/Download all MCQ Ebook
>>>**Click Here**<<<

## Strassen's Algorithm Multiple choice Questions and Answers (MCQs)

## Click on any option to know the CORRECT ANSWERS

Question 1 |

Strassen's algorithm is a/an..... algorithm.

Non- recursive | |

Recursive | |

Approximation | |

Accurate |

**UPSC GS Questions answers**

Question 1 Explanation:

Strassen's Algorithm for matrix multiplication is a recursive algorithm since the present output depends on previous outputs and inputs.

Question 2 |

What is the running time of Strassen's algorithm for matrix multiplication?

O(n ^{2.81}) | |

O(n ^{3}) | |

O(n ^{1.8}) | |

O(n ^{2}) |

**Education Questions answers**

Question 2 Explanation:

Strassen's matrix algorithm requires only 7 recursive multiplications of n/2 x n/2 matrix and Theta(n

^{2}) scalar additions and subtractions yielding the running time as O(n^{2.81}).

Question 3 |

What is the running time of naive matrix multiplication algorithm?

O(n ^{2.81}) | |

O(n ^{4}) | |

O(n) | |

O(n ^{3}) |

**Data interpretation (DI) Questions answers**

Question 3 Explanation:

The traditional matrix multiplication algorithm takes O(n

^{3}) time. The number of recursive multiplications involved in this algorithm is 8.

Question 4 |

Strassen's matrix multiplication algorithm follows ..... technique.

Greedy technique | |

Dynamic Programming | |

Divide and Conquer | |

Backtracking |

**Geography Questions answers**

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.

Question 5 |

The number of scalar additions and subtractions used in Strassen's matrix multiplication algorithm is .....

O(n ^{2.81}) | |

Theta(n ^{2}) | |

Theta(n) | |

O(n ^{3}) |

**Sociology Questions answers**

Question 5 Explanation:

Using Theta(n

^{2}) 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.