search
Log In

Recent questions tagged matrix-chain-ordering

0 votes
2 answers
1
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$
asked Mar 24 in Algorithms jothee 87 views
1 vote
2 answers
2
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 time to compute the product as $(M_1M_2)M_3$ than to compute $M_1(M_2M_3)$ ? Always take the same time $(1/x +1/z)<(1/w+1/y)$ $x>y$ $(w+x)>(y+z)$
asked Jan 13 in Algorithms Satbir 302 views
1 vote
1 answer
3
Is there any shortcut or Trick to get min number of multiplication faster? I mean if we could know the right split.
asked Dec 8, 2018 in Algorithms Nivedita Singh 213 views
2 votes
1 answer
4
How to understand the nesting of for loops in these algorithms like which for loop comes under the other ?
asked Jul 23, 2018 in Algorithms Prince Sindhiya 142 views
2 votes
2 answers
5
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 scalar multiplications required to find the product $A1, A2 ,A3, A4, A5$ using the basic matrix multiplication method is_______
asked Dec 10, 2017 in Algorithms Parshu gate 891 views
1 vote
2 answers
6
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=j dp[i,j]=min{dp[i,k]+dp[k+1,j]} dp[i,j]=1 if i=j dp[i,j]=min{dp[i,k]+dp[k+1,j]}+p[i-1]*p[k]*p[j] dp[i,j]=0 if i=j dp[i,j]=min{dp[i,k]+dp[k+1,j]} dp[i,j]=0 if i=j dp[i,j]=min{dp[i,k]+dp[k+1,j]}+p[i-1]*p[k]*p[j]
asked Nov 27, 2017 in Algorithms Parshu gate 1k views
1 vote
2 answers
7
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_{4}\rightarrow 4\times 2$ The following table is filled up using dynamic programming in order to find minimum number of scalar multiplications$:$ What are the values of $P$ and $Q?$ $60,140$ $60,82$ $60,40$ $60,92$
asked Dec 30, 2016 in Algorithms firki lama 475 views
1 vote
0 answers
8
0 votes
1 answer
9
1 vote
2 answers
10
Consider the problem of a chain $<A_{1}, A_{2}, A_{3}>$ of three matrices. Suppose that the dimensions of the matrices are $10 \times 100$, $100 \times 5$ and $5 \times 50$ respectively. There are two different ways of parenthesization : (i) ... $5$ $10$ $20$ $100$
asked Jul 28, 2016 in Algorithms makhdoom ghaya 556 views
0 votes
1 answer
11
The number of possible paranthesizations of a sequence of n matrices is O(n) $\theta$(n Ig n) $\Omega(2^n)$ None of the above
asked Jul 24, 2016 in Algorithms jothee 413 views
2 votes
4 answers
12
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 total scalar multiplications. For example, when multiplied as ((M1 x M2) x (M3 x M4)) total number of scalar multiplications is ... If p = 10, q = 100, r = 20, s = 5, and t = 80, then what is the minimum number of scalar multiplications needed ?
asked Jul 12, 2016 in Algorithms sh!va 7.3k views
To see more, click for the full list of questions or popular tags.
...