Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

Consider the following pattern of numbers: \(\dfrac{\begin{matrix} 8 \\\ 6 \ \\\ 4 \ \end{matrix}}{ \ 6} \ \ \dfrac{\begin{matrix} 10 \\\ 5 \ \\\ 6 \ \end{matrix}}{ \ 11} \ \ \dfrac{\begin{matrix} 15 \\\ 7 \ \\\ 8 \ \end{matrix}}{ \ 16} \ \ \dfrac{\begin{matrix} 13 \\\ 4 \ \\\ 8 \ \end{matrix}}{ \ ?}\) What is the number at ? in the above pattern?
Compute the product matrix using Strassen’s matrix multiplication algorithm. Given a11=1; a12=3;a21=5;a22=7 b11=8;b12=4;b21=6;b22=2
Assume that multiplying a matrix G1 of dimension ? × ? with another matrix G2 of dimension ? × ? requires ??? scalar multiplications. Computing the product of n matrices G1G2G3…Gn can be done by parenthesizing in different ways. Define Gi Gi+1 as an explicitly computed pair for a given paranthesization if they are directly multiplied. For example, in the matrix multiplication chain G1G2G3G4G5G6 using parenthesization (G1(G2G3))(G4(G5G6)), G2G3 and G5G6 are the only explicitly computed pairs.Consider a matrix multiplication chain F1F2F3F4F5, where matrices F1, F2, F3, F4 and F5 are of dimensions 2 × 25, 25 × 3, 3 × 16, 16 × 1 and 1 × 1000, respectively. In the parenthesization of F1F2F3F4F5 that minimizes the total number of scalar multiplications, the explicitly computed pairs is/are
Strassen’s matrix multiplication algorithm follows ___________ technique.
The number of scalar additions and subtractions used in Strassen’s matrix multiplication algorithm is ________
Which of the following is/are the property (ies) of multiplication in integers? I. Multiplication is associative II. Multiplication is closed III. Multiplication distributes over addition
Consider the following statements regarding homogenous coordinate transformation matrix: 1. A homogenous transformation matrix can be considered to consist of four sub-matrices. 2. The upper left 3 × 3 sub-matrix represents the position vector. 3. The upper right 3 × 1 sub-matrix represents the rotation matrix. 4. The lower left 1 × 3 sub-matrix represents perspective transformation. Which of the above statements are correct? 
How many recursive calls are there in Recursive matrix multiplication by Strassen’s Method?
Running time of Strassen’s algorithm is better than the naïve Theta(n3) method.
Is Coppersmith-Winograd algorithm better than Strassen’s algorithm in terms of time complexity?