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

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
No of multiplications
+1
vote
202
views
matrixchainordering
asked
Dec 15, 2016
in
Algorithms
by
santhoshdevulapally
Boss

202
views
answer
comment
0
Is it 9?
0
yes,explain
i know formula i.e) divide and conquer,but there is any procedure
+1
There is no formula for this. Divide and conquer is the only approach. Start from small and move big.
0
please explain it.
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Prev.
Next →
← Prev. Qn. in Sub.
Next Qn. in Sub. →
Related questions
+2
votes
4
answers
1
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

6.8k
views
algorithms
matrixchainordering
+2
votes
2
answers
2
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_______
asked
Dec 10, 2017
in
Algorithms
by
Parshu gate
Active

825
views
matrixchainordering
dynamicprogramming
algorithms
0
votes
2
answers
3
UGCNETJan2017III: 34
The minimum number of scalar multiplication required, for parenthesization of a matrixchain product whose sequence of dimensions for four matrices is $< 5,10,3,12,5> $ is $630$ $580$ $480$ $405$
asked
Mar 24
in
Algorithms
by
jothee
Veteran

15
views
ugcnetjan2017iii
algorithms
matrixchainordering
+1
vote
2
answers
4
ISRO202079
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
by
Satbir
Boss

236
views
isro2020
algorithms
matrixchainordering
normal
Amazon.in Widgets
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
IIT gandhinagar mtech cse2020
IIT Delhi Research Interview Shortlists out
IIT Gandhinagar interview experience
IIT Gandhinagar Interview 2020
DRDO Scientist B recruitment Notification
Subjects
All categories
General Aptitude
1.9k
Engineering Mathematics
8.1k
Digital Logic
2.9k
Programming and DS
5k
Algorithms
4.4k
Theory of Computation
6.2k
Compiler Design
2.2k
Operating System
4.6k
Databases
4.2k
CO and Architecture
3.4k
Computer Networks
4.2k
Non GATE
1.1k
Others
1.6k
Admissions
595
Exam Queries
573
Tier 1 Placement Questions
23
Job Queries
71
Projects
18
Unknown Category
1k
Recent Blog Comments
Another few, 1. Chrome warns about loading...
I secured 89 out of 216 and not selected. So what...
There was silence for 30 secs after I told...
What is Your Score ...???
which is the book you purchased for previous year...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
52,223
questions
59,811
answers
201,020
comments
118,086
users