Implement the algorithm for an optimal parenthesization of a matrix chain product as dis-cussed in the class.Use the following recursive function as part of your program to print the outcome, assumethe matrixes are namedA1, A2, ..., An.PRINT-OPTIMAL-PARENS(s, i, j){if (i=j) thenprint “A”i else{print “(”PRINT-OPTIMAL-PARENS(s,i,s[i, j])PRINT-OPTIMAL-PARENS(s, s[i, j] + 1, j)print “)”} }a- Test your algorithm for the following cases:1. Find and print an optimal parenthesization of a matrix-chain product whose sequenceof dimensions is<5,10,3, X,12,5,50, Y,6>.2. Find and print an optimal parenthesization of a matrix-chain product whose sequenceof dimensions is<5,10,50,6, X,15,40,18, Y,30,15, Z,3,12,5>. 3. Find and print an optimal parenthesization of a matrix-chain product whose sequenceof dimensions is<50,6, X,15,40,18, Y,5,10,3,12,5, Z,40,10,30,5>. X=10Y=20Z=30 Implement the algorithm for an optimal parenthesization of a matrix chain product as dis-Cussed in the class.Use the following recursive function as part of your program to print the outcome, assumethe matrixes are named A1, A, ., An.PRINT-OPTIMAL-PARENS(s, i, j) {if (i-j) thenprint "A"i else {print "("PRINT-OPTIMAL-PARENS(s,i,s[i, j)PRINT-OPTIMAL-PARENS(s, s[i, j] + 1, j)print “)"}}a- Test your algorithm for the following cases:1. Find and print an optimal parenthesization of a matrix-chain product whose sequenceof dimensions is < 5, 10, 3, X, 12, 5, 50, Y, 6 >.2. Find and print an optimal parenthesization of a matrix-chain product whose sequenceof dimensions is < 5, 10, 50, 6, X, 15, 40, 18, Y, 30, 15, Z, 3, 12,5 >.3. Find and print an optimal parenthesization of a matrix-chain product whose sequenceof dimensions is < 50, 6, X, 15, 40, 18, Y, 5, 10, 3, 12, 5, Z, 40, 10, 30, 5 >.

Answered: Implement the algorithm for an optimal…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

Implement the algorithm for an optimal parenthesization of a matrix chain product as dis-cussed in the class.Use the following recursive function as part of your program to print the outcome, assumethe matrixes are namedA1, A2, ..., An.PRINT-OPTIMAL-PARENS(s, i, j){if (i=j) thenprint “A”i else{print “(”PRINT-OPTIMAL-PARENS(s,i,s[i, j])PRINT-OPTIMAL-PARENS(s, s[i, j] + 1, j)print “)”} }a- Test your algorithm for the following cases:1. Find and print an optimal parenthesization of a matrix-chain product whose sequenceof dimensions is<5,10,3, X,12,5,50, Y,6>.2. Find and print an optimal parenthesization of a matrix-chain product whose sequenceof dimensions is<5,10,50,6, X,15,40,18, Y,30,15, Z,3,12,5>.

3. Find and print an optimal parenthesization of a matrix-chain product whose sequenceof dimensions is<50,6, X,15,40,18, Y,5,10,3,12,5, Z,40,10,30,5>.

X=10

Y=20

Z=30

Implement the algorithm for an optimal parenthesization of a matrix chain product as dis-
Cussed in the class.
Use the following recursive function as part of your program to print the outcome, assume
the matrixes are named A1, A, ., An.
PRINT-OPTIMAL-PARENS(s, i, j) {
if (i-j) then
print "A"i else {
print "("
PRINT-OPTIMAL-PARENS(s,i,s[i, j)
PRINT-OPTIMAL-PARENS(s, s[i, j] + 1, j)
print “)"
}}
a- Test your algorithm for the following cases:
1. Find and print an optimal parenthesization of a matrix-chain product whose sequence
of dimensions is < 5, 10, 3, X, 12, 5, 50, Y, 6 >.
2. Find and print an optimal parenthesization of a matrix-chain product whose sequence
of dimensions is < 5, 10, 50, 6, X, 15, 40, 18, Y, 30, 15, Z, 3, 12,5 >.
3. Find and print an optimal parenthesization of a matrix-chain product whose sequence
of dimensions is < 50, 6, X, 15, 40, 18, Y, 5, 10, 3, 12, 5, Z, 40, 10, 30, 5 >.

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 6 steps with 4 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions