recategorized by
2,379 views
3 votes
3 votes

Consider the problem of a chain <$A_{1} , A_{2} , A_{3},A_{4}$> of four matrices. Suppose that the dimensions of the matrices $A_{1} , A_{2} , A_{3}$ and $A_{4}$ are $30 \times 35, 35 \times 15, 15 \times 5$ and $5 \times 10$ respectively. The minimum number of scalar multiplications needed to compute the product $A_{1}A_{2}A_{3}A_{4}$ is ____.

  1. $14875$
  2. $21000$
  3. $9375$
  4. $11875$
recategorized by

2 Answers

2 votes
2 votes

option C

edited by

Related questions

1 votes
1 votes
1 answer
1
makhdoom ghaya asked Oct 1, 2016
1,285 views
Match the following :$\begin{array}{clcl} \text{a.} & \text{Prim’s algorithm} & \text{i.} & \text{$O(V^2E)$} \\ \text{b.} & \text{Bellman-Ford algorithm} & \text{ii.} ...
1 votes
1 votes
3 answers
2
makhdoom ghaya asked Oct 4, 2016
4,095 views
Which formal system provides the semantic foundation for Prolog ?Predicate calculusLambda calculusHoare logicPropositional logic
1 votes
1 votes
1 answer
4