MCQOPTIONS
Home
About Us
Contact Us
Bookmark
Saved Bookmarks
Testing Subject
General Aptitude
Logical and Verbal Reasoning
English Skills Ability
Technical Programming
Current Affairs
General Knowledge
Finance & Accounting
GATE (Mechanical Engineering)
Chemical Engineering
→
Strassens Algorithm Multiple Choice
→
General
→
Running time of Strassen s algorithm is better tha...
1.
Running time of Strassen s algorithm is better than the na ve Theta(n3) method.
A.
True
B.
False
Answer» B. False
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
Compute the product matrix using Strassen s matrix multiplication algorithm.Given a11=1; a12=3;a21=5;a22=7
Strassen s algorithm is quite numerically stable as the na ve method.
How many iterating statements are involved in the na ve method of matrix multiplication?
Strassen s Matrix Algorithm was proposed by _____________
Who discussed techniques for reducing the memory requirements for Strassen s algorithm?
What is the recurrence relation used in Strassen s algorithm?
Running time of Strassen s algorithm is better than the na ve Theta(n3) method.
The number of scalar additions and subtractions used in Strassen s matrix multiplication algorithm is ________
Strassen s matrix multiplication algorithm follows ___________ technique.
What is the running time of na ve matrix multiplication algorithm?
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply
Your experience on this site will be improved by allowing cookies. Read
Cookie Policy
Reject
Allow cookies
