(a) Using Dynamic Programming find Longest Common Subsequence of the…

Question

(a) Using Dynamic Programming find Longest Common Subsequence of the following two sequences X and Y showing all the steps :

X : B, A, C, D, B

Y : B, D, C, B

(b) List and explain the characteristic properties associated with a problem that can be solved using dynamic programming.

Related pages

• Longest Common Subsequence — topic
• Analysis & Design of Algorithms syllabus