Scribd
Upload
30 views1 page

in Strassen's Multiplication Algorithm The T (N) Is A) 7T (N) + BN B) 7T (n/2) + BN C) 8T (n/2) + BN D) 7T (n/2) + BN

A full binary tree with n leaves contains 2n - 1 nodes. The number of leaf nodes in a complete binary tree of depth d is 2^d. Strassen's Matrix Multiplication Algorithm has a running time of T(n) = 7T(n/2) + bn^2, which is Θ(n^2.81). The depth of a complete binary tree with n nodes is log n.

Uploaded by

Aurangzeb Khan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
30 views1 page

in Strassen's Multiplication Algorithm The T (N) Is A) 7T (N) + BN B) 7T (n/2) + BN C) 8T (n/2) + BN D) 7T (n/2) + BN

A full binary tree with n leaves contains 2n - 1 nodes. The number of leaf nodes in a complete binary tree of depth d is 2^d. Strassen's Matrix Multiplication Algorithm has a running time of T(n) = 7T(n/2) + bn^2, which is Θ(n^2.81). The depth of a complete binary tree with n nodes is log n.

Uploaded by

Aurangzeb Khan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

7

9 to 34
39
48
62
63
69
86
87
105
113
122
125

(70) A full binary tree with n leaves contains


(A) n nodes.
(B) log 2 n nodes.
(C) 2n 1 nodes.

(D) n 2 nodes.

(74) The number of leaf nodes in a complete binary tree of depth d is


(A) 2d
(B) 2d-1 +1
(C) 2d+1 +1
(D)2d +1
(47) In Strassens Multiplication Algorithm the T(n) is
A) 7T (n) + bn2
B) 7T (n/2) + bn 2
C) 8T (n/2) + bn2
bn
(41) The depth of a complete binary tree with n nodes is
(A) log (n+1)-1
(B) log n
(C) log (n-1)+ 1

(88) The running time of Strassens algorithm for matrix multiplication is


(A) (n)
(B) (n3)
(C) (n2)
(D) (n2.81)

D) 7T (n/2) +

(D) log n +1

You might also like