Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged matrix-chain-ordering
0
votes
5
answers
1
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$
go_editor
asked
in
Algorithms
Mar 24, 2020
by
go_editor
2.1k
views
ugcnetcse-jan2017-paper3
algorithms
matrix-chain-ordering
1
vote
3
answers
2
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 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)$
Satbir
asked
in
Algorithms
Jan 13, 2020
by
Satbir
1.6k
views
isro-2020
algorithms
matrix-chain-ordering
normal
2
votes
2
answers
3
self doubt
Is there any shortcut or Trick to get min number of multiplication faster? I mean if we could know the right split.
Nivedita Singh
asked
in
Algorithms
Dec 8, 2018
by
Nivedita Singh
1.1k
views
algorithms
dynamic-programming
matrix-chain-ordering
0
votes
1
answer
4
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
altamash
asked
in
Algorithms
Nov 11, 2018
by
altamash
132
views
dynamic-programming
matrix-chain-ordering
0
votes
1
answer
5
made easy test series
Chetan28kumar
asked
in
Algorithms
Nov 4, 2018
by
Chetan28kumar
368
views
made-easy-test-series
matrix-chain-ordering
dynamic-programming
numerical-answers
0
votes
1
answer
6
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 of scalar multiplications required to find the product B1 B2 B3 B4 B5 using the Matrix Chain Multiplication method _____
mitesh kumar
asked
in
Algorithms
Aug 30, 2018
by
mitesh kumar
295
views
dynamic-programming
test-series
matrix-chain-ordering
numerical-answers
2
votes
1
answer
7
Algorithms - Matrix Chain Ordering
How to understand the nesting of for loops in these algorithms like which for loop comes under the other ?
Prince Sindhiya
asked
in
Algorithms
Jul 23, 2018
by
Prince Sindhiya
418
views
algorithms
matrix-chain-ordering
0
votes
1
answer
8
matrics multiplication
shruti gupta1
asked
in
Algorithms
Jun 29, 2018
by
shruti gupta1
588
views
algorithms
matrix-chain-ordering
dynamic-programming
test-series
1
vote
1
answer
9
Gate 2018
This is another form of gate 2018 matrix-chain question
kunal goswami
asked
in
Algorithms
Jun 28, 2018
by
kunal goswami
319
views
algorithms
dynamic-programming
matrix-chain-ordering
2
votes
2
answers
10
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 scalar multiplications required to find the product $A1, A2 ,A3, A4, A5$ using the basic matrix multiplication method is_______
Parshu gate
asked
in
Algorithms
Dec 10, 2017
by
Parshu gate
2.5k
views
matrix-chain-ordering
dynamic-programming
algorithms
1
vote
3
answers
11
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=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]= ... 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]
Parshu gate
asked
in
Algorithms
Nov 27, 2017
by
Parshu gate
3.2k
views
dynamic-programming
algorithms
matrix-chain-ordering
1
vote
2
answers
12
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_{4}\rightarrow 4\times 2$ The following table is filled ... of scalar multiplications$:$ What are the values of $P$ and $Q?$ $60,140$ $60,82$ $60,40$ $60,92$
firki lama
asked
in
Algorithms
Dec 30, 2016
by
firki lama
958
views
algorithms
dynamic-programming
matrix-chain-ordering
virtual-gate-test-series
0
votes
1
answer
13
Matrix Multiplication
Matrix multiplication is associative and matrix chain multiplication uses following matrices A1 is 30×35 A2 is 35×15 A3 is 15×5 A4 is 5×10 A5 is 10×20 A6 is 20×25 Find the minimum number of multiplications required to compute A1 A2 A3 A4A5A6
Rohan Mundhey
asked
in
Algorithms
Nov 11, 2016
by
Rohan Mundhey
1.0k
views
algorithms
matrix-chain-ordering
dynamic-programming
0
votes
1
answer
14
matrix multiplication
jenny101
asked
in
Algorithms
Oct 26, 2016
by
jenny101
828
views
matrix
algorithms
matrix-chain-ordering
1
vote
4
answers
15
UGC NET CSE | December 2014 | Part 3 | Question: 35
Consider the problem of a chain $\langle A_{1}, A_{2}, A_{3}\rangle$ of three matrices. Suppose that the dimensions of the matrices are $10 \times 100$, $100 \times 5$ and $5 \times 50$ respectively. There are ... according to the first parenthesization is ______ times faster in comparison to the second parenthesization. $5$ $10$ $20$ $100$
makhdoom ghaya
asked
in
Algorithms
Jul 28, 2016
by
makhdoom ghaya
1.3k
views
ugcnetcse-dec2014-paper3
algorithms
matrix-chain-ordering
0
votes
1
answer
16
UGC NET CSE | September 2013 | Part 3 | Question: 39
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
go_editor
asked
in
Algorithms
Jul 24, 2016
by
go_editor
978
views
ugcnetcse-sep2013-paper3
algorithms
dynamic-programming
matrix-chain-ordering
2
votes
4
answers
17
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 total scalar multiplications. For example, when multiplied as ((M1 x M2 ... 100, r = 20, s = 5, and t = 80, then what is the minimum number of scalar multiplications needed ?
sh!va
asked
in
Algorithms
Jul 12, 2016
by
sh!va
18.6k
views
algorithms
matrix-chain-ordering
3
votes
2
answers
18
matrix multiplication
Sourabh Kumar
asked
in
Algorithms
May 21, 2016
by
Sourabh Kumar
1.3k
views
algorithms
matrix-chain-ordering
test-series
1
vote
1
answer
19
Made Easy FLT
Assume Am × n, Bn × p and Cp × q are matrices where m > n > p > q. How many minimum number of multiplications are required to perform the following operation? Am × n × Bn × p × Cp × q [= (A B C)m × q] a) mnp+npq b) mnp+mpq c)mnq+npq d) mnq+mpq
sampad
asked
in
Algorithms
Jan 24, 2016
by
sampad
261
views
matrix-chain-ordering
To see more, click for the
full list of questions
or
popular tags
.
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
From GATE to Australia
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
All India GO Classes Mock test
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(853)
Recent questions tagged matrix-chain-ordering
Recent Blog Comments
This guy was just exceptional. I remember hearing...
Inspirational! Found the right Blog at the right...
That was my second attempt. I already had notes,...
Sorry to break the news, but: I see a few flaws...
bhai mujhe bhi bula lo australia......mai bhi...