The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent questions tagged matrixchainordering
+1
vote
1
answer
1
self doubt
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
by
Nivedita Singh
(
29
points)

109
views
algorithms
dynamicprogramming
matrixchainordering
+2
votes
1
answer
2
Algorithms  Matrix Chain Ordering
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
by
Prince Sindhiya
Loyal
(
5.5k
points)

39
views
algorithms
matrixchainordering
0
votes
2
answers
3
Matrix multiplications
Let A1, A2, A3, A4, A5 be five matrices of dimensions 2×3, 3×5, 5×2, 2×4, 4×3 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
by
Parshu gate
Active
(
3.1k
points)

687
views
matrixchainordering
dynamicprogramming
algorithms
+1
vote
2
answers
4
Matrix chain multiplication
Which of the following is the recurrence relation for the matrix chain multiplication problem where p[i1]*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[i1]*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[i1]*p[k]*p[j]
asked
Nov 27, 2017
in
Algorithms
by
Parshu gate
Active
(
3.1k
points)

662
views
dynamicprogramming
algorithms
matrixchainordering
+1
vote
2
answers
5
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$
asked
Dec 30, 2016
in
Algorithms
by
firki lama
Junior
(
661
points)

316
views
algorithms
dynamicprogramming
matrixchainordering
virtualgatetestseries
+1
vote
0
answers
6
No of multiplications
asked
Dec 15, 2016
in
Algorithms
by
santhoshdevulapally
Boss
(
12.7k
points)

145
views
matrixchainordering
0
votes
1
answer
7
matrix multiplication
asked
Oct 26, 2016
in
Algorithms
by
jenny101
Active
(
1.1k
points)

361
views
matrices
algorithms
matrixchainordering
0
votes
1
answer
8
UGCNETSep2013III39
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
by
jothee
Veteran
(
100k
points)

309
views
ugcnetsep2013iii
algorithms
dynamicprogramming
matrixchainordering
+2
votes
4
answers
9
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 ?
asked
Jul 12, 2016
in
Algorithms
by
sh!va
Boss
(
32.1k
points)

5.8k
views
algorithms
matrixchainordering
To see more, click for the
full list of questions
or
popular tags
.
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
Previous Years Question Papers : ISI  MMA, PCB, DCG
Previous Years Question Papers : CMI  Computer Science
Minimum Number of States in a DFA accepting a binary number divisible by 'n'
GATE 2020 Application Form Opened!
My GATE Preparation Journey
Follow @csegate
Recent questions tagged matrixchainordering
Recent Blog Comments
Thanks for this post.
Thanks a ton for sharing this.
Thank you Arjun Sir.. Your blogs inspire a lot..
Feedback for next edition (if ever there's...
50,093
questions
55,329
answers
190,852
comments
86,255
users