if you want to remove an article from website contact us from top.

    what is the running time of naïve matrix multiplication algorithm?

    Mohammed

    Guys, does anyone know the answer?

    get what is the running time of naïve matrix multiplication algorithm? from screen.

    What is the running time of naive matrix multiplication algorithm?

    Click here👆to get an answer to your question ✍️ What is the running time of naive matrix multiplication algorithm?

    Question

    What is the running time of naive matrix multiplication algorithm?

    AO(n

    2.81 )

    BO(n

    4 )

    C

    O(n)

    DO(n

    3 ) Medium Open in App Solution Verified by Toppr

    Correct option is D)

    Was this answer helpful?

    0 0

    स्रोत : www.toppr.com

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

    What is the running time of Strassen’s algorithm for matrix multiplication? (a) O(n^2.81) (b) O(n^3) (c) O(n^1.8) (d) O(n^2)

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

    ← Prev Question Next Question →

    1 Answer

    ← Prev Question Next Question →

    Find MCQs & Mock Test

    Free JEE Main Mock Test

    Free NEET Mock Test

    Class 12 Chapterwise MCQ Test

    Class 11 Chapterwise Practice Test

    Class 10 Chapterwise MCQ Test

    Class 9 Chapterwise MCQ Test

    Class 8 Chapterwise MCQ Test

    Class 7 Chapterwise MCQ Test

    Related questions

    स्रोत : www.sarthaks.com

    Strassen's Algorithm Questions and Answers

    This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Strassen’s Algorithm”. 1. Strassen’s algorithm is a/an_____________ algorithm. a) Non- recursive b) Recursive c) Approximation d) Accurate 2. 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) 3. What is ... Read more

    Strassen’s Algorithm Multiple Choice Questions and Answers (MCQs)

    « Prev Next »

    This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Strassen’s Algorithm”.

    1. Strassen’s algorithm is a/an_____________ algorithm.

    a) Non- recursive b) Recursive c) Approximation d) Accurate View Answer

    2. 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) View Answer

    3. What is the running time of naïve matrix multiplication algorithm?

    a) O(n2.81) b) O(n4) c) O(n) d) O(n3) View Answer

    Sanfoundry Certification Contest of the Month is Live. 100+ Subjects. Participate Now!

    advertisement

    4. Strassen’s matrix multiplication algorithm follows ___________ technique.

    a) Greedy technique

    b) Dynamic Programming

    c) Divide and Conquer

    d) Backtracking View Answer

    5. 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) View Answer

    Check this: Data Structure MCQ | Programming Books

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

    a) True b) False View Answer

    7. Given the program of naïve method.

    advertisement for i=1 to n do for j=1 to n do Z[i][j]=0; for k=1 to n do

    ___________________________

    Fill in the blanks with appropriate formula

    a) Z[i][j] = Z[i][j] + X[i][k]*Y[k][j]

    b) Z[i][j] = Z[i][j] + X[i][k] + Y[k][j]

    c) Z[i][j] = Z[i][j] * X[i][k]*Y[k][j]

    d) Z[i][j] = Z[i][j] * X[i][k] + Y[k][j]

    View Answer advertisement

    8. Who demonstrated the difference in numerical stability?

    a) Strassen b) Bailey c) Lederman d) Higham View Answer

    9. 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) View Answer

    10. Who discussed techniques for reducing the memory requirements for Strassen’s algorithm?

    a) Strassen b) Lederman c) Bailey d) Higham View Answer

    11. What is the formula to calculate the element present in second row, first column of the product matrix?

    a) M1+M7 b) M1+M3 c) M2+M4 – M5 + M7 d) M2+M4 View Answer

    12. Strassen’s Matrix Algorithm was proposed by _____________

    a) Volker Strassen b) Andrew Strassen c) Victor Jan

    d) Virginia Williams

    View Answer

    13. How many iterating statements are involved in the naïve method of matrix multiplication?

    a) 1 b) 2 c) 3 d) 4 View Answer

    14. Strassen’s algorithm is quite numerically stable as the naïve method.

    a) True b) False View Answer

    15. 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

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

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

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

    d) c11=26;c12=10;c21=82;c22=34

    View Answer

    Sanfoundry Global Education & Learning Series – Data Structures & Algorithms.

    To practice all areas of Data Structures & Algorithms, here is complete set of 1000+ Multiple Choice Questions and Answers.

    « Prev - Euclid’s Algorithm Multiple Choice Questions and Answers (MCQs)

    » Next - Pseudorandom Number Generators Multiple Choice Questions and Answers (MCQs)

    Next Steps:

    Get Free Certificate of Merit in Data Structure II

    Participate in Data Structure II Certification Contest

    Become a Top Ranker in Data Structure II

    Take Data Structure II Tests

    Chapterwise Practice Tests: Chapter 1, 2, 3, 4, 5, 6, 7, 8, 9, 10

    Chapterwise Mock Tests: Chapter 1, 2, 3, 4, 5, 6, 7, 8, 9, 10

    Related Posts:

    Buy Design and Analysis of Algorithms Books

    Buy Computer Science Books

    Buy Programming Books

    Apply for Information Technology Internship

    Apply for Design and Analysis of Algorithms Internship

    advertisement

    Recommended Articles:

    Matrix Multiplication using Recursion Multiple Choice Questions and Answers (MCQs)

    C Program to Implement Strassen’s Algorithm

    Chan’s Algorithm Multiple Choice Questions and Answers (MCQs)

    Euclid’s Algorithm Multiple Choice Questions and Answers (MCQs)

    Rabin-Karp Algorithm Multiple Choice Questions and Answers (MCQs)

    Java Program to Implement Strassen’s Algorithm

    Floyd-Warshall Algorithm Multiple Choice Questions and Answers (MCQs)

    Quick Search Algorithm Multiple Choice Questions and Answers (MCQs)

    Dijkstra’s Algorithm Multiple Choice Questions and Answers (MCQs)

    Bellman-Ford Algorithm Multiple Choice Questions and Answers (MCQs)

    advertisement

    Additional Resources:

    Design & Analysis of Algorithms MCQ Questions

    C++ Algorithm Library

    Automata Theory MCQ Questions

    Computer Graphics MCQ Questions

    Class 12 Maths MCQ Questions

    Popular Pages:

    Operating System MCQ Questions

    Antenna MCQ Questions

    स्रोत : www.sanfoundry.com

    Do you want to see answer or more ?
    Mohammed 16 day ago
    4

    Guys, does anyone know the answer?

    Click For Answer