Q. What is the time complexity of matrix multiplied recursively by Divide and Conquer Method?

  • (A) o(n)
  • (B) o(n2)
  • (C) o(n3)
  • (D) o(n!)
πŸ’¬ Discuss
βœ… Correct Answer: (C) o(n3)
Explanation: the time complexity of recursive multiplication of two square matrices by the divide and conquer method is found to be o(n3) since there are total of 8 recursive calls.

Published by Mr. Dubey ⭐ 111.54K Points at 16-Sep-2023 03:43 pm in Design and Analysis of Algorithms

Explanation by: Mr. Dubey
the time complexity of recursive multiplication of two square matrices by the divide and conquer method is found to be o(n3) since there are total of 8 recursive calls.

πŸ’¬ Discussion

Related MCQs

Q. Which is not application software?

Q. What are the key reasons for compressing data?

Q. what is the use of exec command

Q. Suppose a TCP connection is transferring a file of 1000 bytes. The first byte is numbered 10001. What is the sequence number of the segment if all dat

Q. The collection of data is achieved with changes.

Q. . Which set S does the power set 2S = {Π€,{1}, {2}, {3}, {1, 2}, {1, 3}, {2, 3}, {1, 2, 3}} come from?

Q. MTBF stands for

Q. Compromising confidential information comes under _________.

Q. Time Complexity of k-means is given by

Q. Which of the following is not the internal sort?

πŸ“Š Question Analytics

πŸ‘οΈ
223
Total Visits
πŸ“½οΈ
3 y ago
Published
πŸŽ–οΈ
Mr. Dubey
Publisher
πŸ“ˆ
84%
Success Rate