adplus-dvertising
frame-decoration

Question

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)

Answer: (b).O(n^2.81)

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Let A and B be two n x n matrices,The efficient algorithm to multiply the two matrices , has the time complexity

Similar Questions

Discover Related MCQs

Q. Assuming there are n keys and each key is in the range [0, m - 1]. The run time of bucket sort is

Q. You have to sort a list L, consisting of a sorted list followed by a few 'random' elements. Which of the following sorting method would be most suitable for such a task?

Q. A full binary tree with n leaves contains

Q. How many PUSH and POP operations will be needed to evaluate the following expression by reverse polish notation in a stack machine (A * B) + (C * D/E)?

Q. Consider an array A[20. 10], assume 4 words per memory cell and the base address of array A is 100. What is the address of A[11,5]? Assume row major storage.

Q. Convert the following infix expression into its equivalent post fix expression (A + B^D)/(E - F) + G

Q. Any decision tree that sorts n elements has height

Q. Match the following .
     List- I                                                    List - II
a. Bucket sort                                      i. O(n^3/gn)
b. Matrix chain multiplication           ii. O(n^3) 
c. Huffman codes                             iii. O(nlgn)
d. All pairs shortest paths               iv. O(n)

code:
a   b   c   d

Q. Suppose that we have numbers between 1 and 1000 in a binary search tree and we want to search for the number 365. Which of the following sequences could not be the sequence of nodes examined ?

Q. Converting a primitive type data into its corresponding wrapper class object instance is called

Q. Consider the following statements-

(a) Depth - first search is used to traverse a rooted tree. 
(b) Pre - order, Post-order and Inorder are used to list the vertices of an ordered rooted tree.
(c) Huffman's algorithm is used to find an optimal binary tree with given weights.
(d) Topological sorting provides a labelling such that the parents have larger labels than their children.

Which of the above statements are true ?

Q. The inorder and preorder Traversal of binary Tree are dbeafcg and abdecfg respectively.The post order traversal is ______________.

Q. Level order Traversal of a rooted Tree can be done by starting from root and performing

Q. The average case occurs in the Linear Search Algorithm when :

Q. To determine the efficiency of an algorithm the time factor is measured by

Q. Which of the following algorithms sort n integers, having the range 0 to (n^2 - 1), in ascending order in O(n) time ?

Q. Which of the following is asymptotically smaller?

Q. Code blocks allow many algorithms to be implemented with the following parameters:

Q. Consider f(N) = g(N) + h(N) 
Where function g is a measure of the cost of getting from the start node to the current node N and h is an estimate of additional cost of getting from the current node N to the goal node. Then f(N) = h(N) is used in which one of the following algorithms ? 

Q. The reverse polish notation equivalent to the infix expression
((A + B) * C+ D)/(E + F + G)