ADVANCED DESIGN AND ANALYSIS OF ALGORITHMS - ASSIGNMENT 3 [20 points]
Assignment Date: 30 November 2020
Due Date: 04 December 2020 Midnight
INSTRUCTIONS:
A. Please do your own work.
B. Submit your work well before time.
C. Plagiarized work shall earn zero credit for the submission.
TASKS:
1. Compute the minimum number of multiplications required for the matrix chain A 1 × 5, B 5 × 10,
C 10 × 15, D 15 × 20, E 20 × 5. Show the contents of the dynamic programming table along with the
calculations considered. Also give the recurrence?
2. Compute the Longest Common Subsequence for the strings X = [ABCDABCAB] and Y = [BCBCB].
Show the contents of the dynamic programming table. Also give the recurrence?