For matrix multiplication, if we use divide and conquer algorithm, then…

UGC NET 2022

For matrix multiplication, if we use divide and conquer algorithm, then ______.

A. The running time is T(n)=Θ(n³).

B. The running time is T(n)=Θ(n² log n).

C. The recurrence can be defined as T(n)=8T(n/2)+Θ(n²).

D. The recurrence relation is T(n)=8T(2n)+Θ(n² log n).

E. Masters theorem, one of the cases is applicable.

Choose the most appropriate answer from the options given below:

  1. A.

    A, C, E only

  2. B.

    A, D, E only

  3. C.

    B, D, E only

  4. D.

    B, C, D only

Attempted by 8 students.

Sign up free to check your answer

Sign up free

Explore the full course: Uppsc Polytechnic Lecturer 2025 Cs

Loading lesson…