Recent questions tagged matrix-chain-ordering / GATE Overflow for GATE CSE

0 votes

1 answer

1

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 \times p)$ $\text{O(m} \times n \times p^2)$ $\text{O(m} \times n \times p)$

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...

Ramayya

237 views

Ramayya asked Jan 7

0 votes

1 answer

2

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$

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$ r...

admin

423 views

admin asked Jul 21, 2022

3 votes

2 answers

3

GATE Overflow Test Series | Algorithms | Test 1 | Question: 25
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 is several ways with different number of total scalar multiplications. For example, when multiplied as ... $t = 40$, then the minimum number of scalar multiplications needed is

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 is several ways with different numb...

gatecse

266 views

gatecse asked Aug 18, 2020

0 votes

0 answers

4

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 in several ways with different number of total scalar multiplications. For example, when ... $t=80$, then the number of scalar multiplications needed is $248000$ $44000$ $19000$ $25000$

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 in several ways with diffe...

admin

967 views

admin asked Mar 30, 2020

0 votes

5 answers

5

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$

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...

go_editor

3.6k views

go_editor asked Mar 24, 2020

3 votes

3 answers

6

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)$

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 ...

Satbir

2.8k views

Satbir asked Jan 13, 2020

2 votes

2 answers

7

self doubt
Is there any shortcut or Trick to get min number of multiplication faster? I mean if we could know the right split.

Is there any shortcut or Trick to get min number of multiplication faster? I mean if we could know the right split.

Nivedita Singh

1.5k views

Nivedita Singh asked Dec 8, 2018

0 votes

1 answer

8

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

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

351 views

altamash asked Nov 11, 2018

0 votes

1 answer

9

made easy test series

Chetan28kumar

692 views

Chetan28kumar asked Nov 4, 2018

0 votes

1 answer

10

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 _____

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 f...

mitesh kumar

461 views

mitesh kumar asked Aug 30, 2018

2 votes

1 answer

11

Algorithms - Matrix Chain Ordering
How to understand the nesting of for loops in these algorithms like which for loop comes under the other ?

How to understand the nesting of for loops in these algorithms like which for loop comes under the other ?

Prince Sindhiya

519 views

Prince Sindhiya asked Jul 23, 2018

0 votes

1 answer

12

matrics multiplication

shruti gupta1

870 views

shruti gupta1 asked Jun 29, 2018

1 votes

1 answer

13

Gate 2018
This is another form of gate 2018 matrix-chain question

This is another form of gate 2018 matrix-chain question

kunal goswami

473 views

kunal goswami asked Jun 28, 2018

2 votes

2 answers

14

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_______

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 requ...

Parshu gate

3.2k views

Parshu gate asked Dec 10, 2017

1 votes

3 answers

15

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]

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=jd...

Parshu gate

4.2k views

Parshu gate asked Nov 27, 2017

1 votes

2 answers

16

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$

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...

firki lama

1.2k views

firki lama asked Dec 29, 2016

0 votes

1 answer

17

Ace Test Series: Algorithms - Dynamic Programming
the given answer is 10200 but i am getting 20100

the given answer is 10200 but i am getting 20100

tejas dadhe

459 views

tejas dadhe asked Dec 13, 2016

0 votes

1 answer

18

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

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...

Rohan Mundhey

1.6k views

Rohan Mundhey asked Nov 11, 2016

0 votes

1 answer

19

matrix multiplication

jenny101

1.1k views

jenny101 asked Oct 26, 2016

1 votes

4 answers

20

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$

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$ an...

makhdoom ghaya

2.3k views

makhdoom ghaya asked Jul 28, 2016

0 votes

1 answer

21

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

The number of possible paranthesizations of a sequence of n matrices isO(n)$\theta$(n Ig n)$\Omega(2^n)$None of the above

go_editor

1.3k views

go_editor asked Jul 24, 2016

2 votes

4 answers

22

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 ?

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 multi...

sh!va

22.1k views

sh!va asked Jul 12, 2016

3 votes

2 answers

23

matrix multiplication

Sourabh Kumar

1.9k views

Sourabh Kumar asked May 21, 2016

42 votes

7 answers

24

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 minimum number of scalar multiplications required to find the product $A_{1}A_{2}A_{3}A_{4}$ using the basic matrix multiplication method is _________.

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 minimum number of scala...

Akash Kanase

22.7k views

Akash Kanase asked Feb 12, 2016

1 votes

1 answer

25

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

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? ...

sampad

375 views

sampad asked Jan 24, 2016

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