chain multiplication

Sourabh Kumar asked May 20, 2016

490 views

0 votes

what is the faster way to calculate in short time

CO and Architecture
algorithms

+ –

Sourabh Kumar asked May 20, 2016

Sourabh Kumar

490 views

See all

0 Please log in or register to add a comment.

Please log in or register to answer this question.

2 Answers

0 votes

Check by option if your result is less than any of 3 option and 4th option is even lesser than your result then mark 4th option.

If any how in between you get your ans than its best case.

otherwise do all possibility until you get your result.

ManojK answered May 20, 2016

ManojK

See all

0 Please log in or register to add a comment.

0 votes

Answer is $226$ and the order of multiplication is $(A)(((BC)D)(E))$

Debapaul answered Jan 5, 2020

Debapaul

See all

0 Please log in or register to add a comment.

Voting & Accepting an answer helps improve the community

← Previous Next →

← Previous in category Next in category →

Related questions

1 votes

3 answers

Parshu gate asked Nov 27, 2017

4,281 views

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.3k views

Parshu gate asked Nov 27, 2017

Algorithms
dynamic-programming
algorithms
matrix-chain-ordering

+ –

1 votes

0 answers

Shivangi Verma asked Aug 27, 2016

479 views

Matrix chain multiplication Step 3 in DP Computing the optimal cost
Cormen DP page 335 At this point, it is a simple matter to write a recursive algorithm based on recurrence (15.12) to compute the minimum cost m[1, n] for multiplying A1 A2 · · · An . As we shall see in Section 15.3, however, this algorithm takes ... n, or n chose 2 +n ^2=O(n^2) How do we deduce it is n choose 2 + n^2 =O(n2)?

Cormen DP page 335At this point, it is a simple matter to write a recursive algorithm based on recurrence(15.12) to compute the minimum cost m[1, n] for multiplying A1 A2...

Shivangi Verma

479 views

Shivangi Verma asked Aug 27, 2016

2 votes

1 answer

Prince Sindhiya asked Jul 23, 2018

520 views

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

520 views

Prince Sindhiya asked Jul 23, 2018

Algorithms
algorithms
matrix-chain-ordering

+ –

1 votes

0 answers

MIRIYALA JEEVAN KUMA asked Jan 20, 2018

308 views

atleast a chain of 3 in hashing
Consider a hash table with 8 slots that uses chaining for collision resolution. The table is initially empty. What is the probability that after 4 keys are inserted, atleast a chain of size 3 is created? (assume simple uniform hashing is used)

Consider a hash table with 8 slots that uses chaining for collision resolution. The table is initially empty. What is the probability that after 4 keys are inserted, atle...

MIRIYALA JEEVAN KUMA

308 views

MIRIYALA JEEVAN KUMA asked Jan 20, 2018

Probability
probability
combinatory
algorithms
uniform-hashing

+ –

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

0 reply

Please log in or register to add a comment.

Please log in or register to answer this question.

2 Answers

0 reply

Please log in or register to add a comment.

0 reply

Please log in or register to add a comment.

Related questions

0

0

0