Strassen’s Algorithm MCQ

Test your knowledge with important Strassen’s Algorithm MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Strassen’s Algorithm MCQs at Bissoy

• Compute the product matrix using Strassen’s matrix multiplication algorithm. Given a11=1; a12=3;a21=5;a22=7 b11=8;b12=4;b21=6;b22=2
  ক

  c11=20;c12=12;c21=100;c22=15

  খ

  c11=22;c12=8;c21=90;c22=32

  গ

  c11=15;c12=7;c21=80;c22=34

  ঘ

  c11=26;c12=10;c21=82;c22=34
• Strassen’s algorithm is quite numerically stable as the naïve method.
  ক

  True

  খ

  False
• How many iterating statements are involved in the naïve method of matrix multiplication?
  ক

  1

  খ

  2

  গ

  3

  ঘ

  4
• Strassen’s Matrix Algorithm was proposed by _____________
  ক

  Volker Strassen

  খ

  Andrew Strassen

  গ

  Victor Jan

  ঘ

  Virginia Williams
• What is the formula to calculate the element present in second row, first column of the product matrix?
  ক

  M1+M7

  খ

  M1+M3

  গ

  M2+M4 – M5 + M7

  ঘ

  M2+M4
• Who discussed techniques for reducing the memory requirements for Strassen’s algorithm?
  ক

  Strassen

  খ

  Lederman

  গ

  Bailey

  ঘ

  Higham
• What is the recurrence relation used in Strassen’s algorithm?
  ক

  7T(n/2) + Theta(n2)

  খ

  8T(n/2) + Theta(n2)

  গ

  7T(n/2) + O(n2)

  ঘ

  8T(n/2) + O(n2)
• Who demonstrated the difference in numerical stability?
  ক

  Strassen

  খ

  Bailey

  গ

  Lederman

  ঘ

  Higham
• Running time of Strassen’s algorithm is better than the naïve Theta(n3) method.
  ক

  True

  খ

  False
• The number of scalar additions and subtractions used in Strassen’s matrix multiplication algorithm is ________
  ক

  O(n2.81)

  খ

  Theta(n2)

  গ

  Theta(n)

  ঘ

  O(n3)
• Strassen’s matrix multiplication algorithm follows ___________ technique.
  ক

  Greedy technique

  খ

  Dynamic Programming

  গ

  Divide and Conquer

  ঘ

  Backtracking
• What is the running time of naïve matrix multiplication algorithm?
  ক

  O(n2.81)

  খ

  O(n4)

  গ

  O(n)

  ঘ

  O(n3)
• What is the running time of Strassen’s algorithm for matrix multiplication?
  ক

  O(n2.81)

  খ

  O(n3)

  গ

  O(n1.8)

  ঘ

  O(n2)
• Strassen’s algorithm is a/an_____________ algorithm.
  ক

  Non- recursive

  খ

  Recursive

  গ

  Approximation

  ঘ

  Accurate