recategorized
3,452 views
0 votes
0 votes

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

  1. $630$  
  2. $580$ 
  3. $480$  
  4. $405$
recategorized

5 Answers

Answer:

Related questions

0 votes
0 votes
4 answers
5
go_editor asked Mar 24, 2020
2,096 views
Dijkstra’s algorithm is based onDivide and conquer paradigmDynamic programmingGreedy approachBacktracking paradigm
0 votes
0 votes
6 answers
6
go_editor asked Mar 24, 2020
1,502 views
Match the following with respect to algorithm paradigms :$\begin{array}{clcl} & \textbf{List-I} & {} & \textbf{List-II} \\ \text{a.} & \text{Merge sort} & \text{i.} & \te...
0 votes
0 votes
4 answers
7
go_editor asked Jan 31, 2017
2,284 views
Red-black trees are one of many search tree schemes that are “balanced” in order to guarantee that basic dynamic-set operations take _____ time in the worst case.$O(1...
2 votes
2 votes
7 answers
8
go_editor asked Jan 31, 2017
7,510 views
Any decision tree that sorts n elements has height ____$\Omega (\lg \: n)$$\Omega (n)$$\Omega (n \: \lg \: n)$$\Omega (n^2)$