McqMate

Q. |
## Is Coppersmith-Winograd algorithm better than Strassen’s algorithm in terms of time complexity? |

A. | true |

B. | false |

Answer» A. true | |

Explanation: since the coppersmith- winograd algorithm multiplies the matrices in o(n2.37) time. the time complexity of recursive multiplication of two square matrices by strassen’s method is found to be o(n2.80). therefore, coppersmith-winograd |

1.9k

0

Do you find this helpful?

19

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- Rabin Karp algorithm and naive pattern searching algorithm have the same worst case time complexity.
- Recursive solution of subset sum problem is faster than dynamic problem solution in terms of time complexity.
- Recursive solution of Set partition problem is faster than dynamic problem solution in terms of time complexity.
- Which of the following sorting algorithm has best case time complexity of O(n2)?
- What is the worst case time complexity of KMP algorithm for pattern searching (m = length of text, n = length of pattern)?
- What is the time complexity of Z algorithm for pattern searching (m = length of text, n = length of pattern)?
- What is the worst case time complexity of a quick sort algorithm?
- What is the time complexity of Kruskal’s algorithm?
- Worst case is the worst case time complexity of Prim’s algorithm if adjacency matrix is used?
- What is the time complexity of Kadane’s algorithm?