Submit Answer

If you know the answer of below question, then submit your answers. You will receive 10 points on each answer. You can submit pdf and images files also.

If you don't know how to publish answer then click here.

Write the dynamic programming algorithm for matrix chain multiplication. Find the optimal parenthesization for the matrix chain product ABCD with size of each is given as A5×10 , B10×15 , C15×20 , D20×30

Your assets must be related to csit study material.


Can submit multiple images of maximum size of 2MB each.

PDF File

Can submit multiple pdf files of maximum size of 10MB each.


You will receive an email with your answer link after confirmation.