Question 11912 – Algorithms

Consider the problem of a chain < A¹, A², A³> of three matrices. Suppose that the dimensions of the matrices are 10 × 100, 100 × 5 and 5 × 50 respectively. There are two different ways of parenthesization :
(i) ((A¹ A²)A³) and
(ii) (A¹(A² A³)).
Computing the product according to the first parenthesization is ________ times faster in comparison to the second parenthesization.

Correct Answer: B