Register

Recent questions tagged matrix-chain-ordering

121
views
1 answers
0 votes
geeksforgeeks
Let A1, A2, A3, and A4 be four matrices of dimensions 10 x 5, 5 x 20, 20 x 10, and 10 x 5, respectively. The minimum number of scalar multiplications required to find ... multiplication method is: (A) 1500 (B) 2000 (C) 500 (D) 100
User Avatar
303
views
1 answers
0 votes
ISRO 2024
The complexity of matrix multiplication of two matrices A and B whose orders are $m \times n$ and $n \times p$ respectively is$\text{O(m} \times p)$\text{O(m} \times n^2 \ ... $\text{O(m} \times n \times p)$
User Avatar
507
views
1 answers
0 votes
NIELIT 2021 Dec Scientist B - Section B: 71
The number of operations in matrix multiplication $\text{M1, M2, M3, M4}$ and $\text{M5}$ of sizes $5\times 10, 10\times 100, 100\times 2, 2\times 20$ and $20\times 50$ respectively will be:$5830$4600$6900$12890$
User Avatar
1.0k
views
0 answers
0 votes
NIELIT 2017 July Scientist B (CS) - Section B: 41
Four Matrices $M_1, M_2, M_3$ and $M_4$ of dimensions $ p \times q$, $q \times r$, $r \times s$ and $s \times t$ respectively can be multiplied ... $248000$ $44000$ $19000$ $25000$
User Avatar
4.0k
views
5 answers
0 votes
UGC NET CSE | January 2017 | Part 3 | Question: 34
The minimum number of scalar multiplication required, for parenthesization of a matrix-chain product whose sequence of dimensions for four matrices is $< 5,10,3,12,5> $ is$630$ $580$ $480$ $405$
User Avatar
3.0k
views
3 answers
3 votes
ISRO2020-79
Consider product of three matrices $M_1,M_2$ and $M_3$ having $w$ rows and $x$ columns, $x$ rows and $y$ columns, and $y$ rows and $z$ columns. Under what condition will it take less ... the same time$(1/x +1/z)<(1/w+1/y)$x>y$(w+x)>(y+z)$
User Avatar
1.6k
views
2 answers
2 votes
self doubt
Is there any shortcut or Trick to get min number of multiplication faster? I mean if we could know the right split.
User Avatar
386
views
1 answers
0 votes
DYNAMIC PROGRAMMING [self doubts]
how to form The minimum number of scalar multiplications to find the product B1 B2 B3 B4 B5 using the Matrix Chain Multiplication method
User Avatar
755
views
1 answers
0 votes
made easy test series
User Avatar
513
views
1 answers
0 votes
Test series
Let B1, B2, B3, B4, B5 be five matrices of dimensions 15 x 20, 20 x 17, 17 x 22, 22 x 16, 16 x 23 respectively. The minimum number ... required to find the product B1 B2 B3 B4 B5 using the Matrix Chain Multiplication method _____
User Avatar
545
views
1 answers
2 votes
Algorithms - Matrix Chain Ordering
How to understand the nesting of for loops in these algorithms like which for loop comes under the other ?
User Avatar
899
views
1 answers
0 votes
matrics multiplication
User Avatar
507
views
1 answers
1 votes
Gate 2018
This is another form of gate 2018 matrix-chain question
User Avatar
20.0k
views
6 answers
31 votes
GATE CSE 2018 | Question: 31
Assume that multiplying a matrix $G_1$ of dimension $ p \times q$ with another matrix $G_2$ of dimension $q \times r$ requires $pqr$ scalar multiplications. ... $F_3F_4$ only$F_2F_3$ only$F_3F_4$ only$F_1F_2$ and $F_4F_5$ only
User Avatar
3.4k
views
2 answers
2 votes
Matrix Multiplications
Let $A1, A2, A3, A4, A5$ be five matrices of dimensions $2\times3, 3\times5, 5\times2, 2\times4, 4\times3$ respectively. The minimum number of ... the product $A1, A2 ,A3, A4, A5$ using the basic matrix multiplication method is_______
User Avatar
4.4k
views
3 answers
1 votes
Matrix chain multiplication
Which of the following is the recurrence relation for the matrix chain multiplication problem where p[i-1]*p[i] gives the dimension of the i^th matrix? dp[i,j]=1 if i=jdp[i,j]=min{dp[i, ... =jdp[i,j]=min{dp[i,k]+dp[k+1,j]}+p[i-1]*p[k]*p[j]
User Avatar
1.6k
views
2 answers
1 votes
Virtual Gate Test Series: Algorithms - Matrix Chain Ordering
Consider the following chain of matrices $A_{1}$ to $A_{4}$ having dimensions given below$A_{1}\rightarrow 2\times 3$A_{2}\rightarrow 3\times 5$A_{3}\rightarrow 5\times 4$A_ ... $P$ and $Q?$60,140$60,82$60,40$60,92$
User Avatar
498
views
1 answers
0 votes
Ace Test Series: Algorithms - Dynamic Programming
the given answer is 10200 but i am getting 20100
User Avatar
1.7k
views
1 answers
0 votes
Matrix Multiplication
Matrix multiplication is associative and matrix chain multiplication uses following matricesA1 is 30×35A2 is 35×15A3 is 15×5A4 is 5×10A5 is 10×20A6 is 20×25Find the minimum number of multiplications required to compute A1 A2 A3 A4A5A6
User Avatar
1.2k
views
1 answers
0 votes
matrix multiplication
User Avatar
2.5k
views
2 answers
3 votes
UGC NET CSE | August 2016 | Part 3 | Question: 31
Consider the problem of a chain <$A_{1} , A_{2} , A_{3},A_{4}$> of four matrices. Suppose that the dimensions of the matrices $A_{1} , A_{2} , A_{3}$ and ... $ is ____.$14875$21000$9375$11875$
User Avatar
2.5k
views
4 answers
1 votes
UGC NET CSE | December 2014 | Part 3 | Question: 35
Consider the problem of a chain $\langle A_{1}, A_{2}, A_{3}\rangle$ ... $10$20$100$
User Avatar
1.4k
views
1 answers
0 votes
UGC NET CSE | September 2013 | Part 3 | Question: 39
The number of possible paranthesizations of a sequence of n matrices isO(n)$\theta$(n Ig n)$\Omega(2^n)$None of the above
User Avatar
22.8k
views
4 answers
2 votes
Find he minimum number of scalar multiplications in matrix multiplication
Four matrices M1, M2, M3, and M4 have dimensions p x q, q x r, r x s, and s x t respectively can be multiplied in several ways with different number of ... = 5, and t = 80, then what is the minimum number of scalar multiplications needed ?
User Avatar
2.0k
views
2 answers
3 votes
matrix multiplication
User Avatar
23.5k
views
7 answers
43 votes
GATE CSE 2016 Set 2 | Question: 38
Let $A_{1}, A_{2}, A_{3}$ and $A_{4}$ be four matrices of dimensions $10 \times 5, 5 \times 20, 20 \times 10$ and $10 \times 5$, respectively. ... the product $A_{1}A_{2}A_{3}A_{4}$ using the basic matrix multiplication method is _________.
User Avatar
Page: