Register

UGC NET CSE | December 2013 | Part 3 | Question: 35

• edited by
2,570 views

1 Answer

Best answer
3 votes
3 votes

The efficient algorithm to multiply the two matrices has the time complexity O(n2.81) using Strassen’s algorithm.

• selected by
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2.9k
views
2 answers
3 votes
go_editor asked Jul 28, 2016
2,938 views
UGC NET CSE | December 2013 | Part 3 | Question: 36
The recurrence relation $T(n) =mT(\frac{n}{2}) + tan^2$ is satisfied byO(n$^2$)O(n$^{lg \, m}$)O(n$^2 \: lg \:n)$O(n lg n)
User Avatar
2.1k
views
2 answers
2 votes
go_editor asked Jul 28, 2016
2,097 views
UGC NET CSE | December 2013 | Part 3 | Question: 38
Assuming there are n keys and each key is in the range [0, m-1]. The run time of bucket sort isO(n)O(n lgn)O(n lgm)O(n+m)
User Avatar
5.8k
views
2 answers
3 votes
go_editor asked Jul 28, 2016
5,773 views
UGC NET CSE | December 2013 | Part 3 | Question: 37
The longest common subsequence of the sequences $X=<A, B, C, B, D, A, B>$ and $Y=<B, D, C, A, B, A>$ has length$2$3$4$5$
User Avatar
3.3k
views
2 answers
2 votes
go_editor asked Jul 26, 2016
3,318 views
UGC NET CSE | December 2013 | Part 2 | Question: 35
Big-O estimate for $f(x)=(x+1) \log(x^2 +1) + 3x^2 $ is given as$O(x \log x)$O(x^2)$O(x^3)$O(x^2 \log x)$
User Avatar
Link Copied!