UGC COMPUTER SCIENCE DEC 2013 SOLUTION
This site provide you the understanding of UGC-CS DEC 2013 solutions.
Chitika
Friday, 3 January 2014
Ques 35-III-D-13
35. Let A and B be two n x n matrices. The efficient algorithm to
Multiply the two matrices has the time complexity
(A) O(n
3
)
(B) O(n
2.81
)
(C) O(n
2.67
)
(D) O(n
2
)
ANS-(B)
Description is coming tomorrow---
No comments:
Post a Comment
Newer Post
Older Post
Home
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment