info@avatto.com
+91-9920808017
0. We wish to find the length of the longest common subsequence (LCS) of X[m] and Y[n] as l(m, n), where an incomplete recursive definition for the function l(i, j) to compute the length of the LCS of X[m] and Y[n] is given below: l(i, j) = 0, if either i = 0 or j = 0 = expr1, if i, j > 0 and x[i –1] = Y [j -1] = expr2, if i, j > 0 and x[i – 1] ≠ Y[j –1] Which one of the following options is correct?
expr1 ≡ l(i–1, j) + 1
expr1 ≡ l(i, j – 1)
expr2 ≡ max (l(i–1, j), l(i, j – 1))
expr2 ≡ max (l(i–1, j – 1), /(i, j))
You must be logged in to post a comment.
Login with Facebook
Login with Google
Forgot your password?
Lost your password? Please enter your email address. You will receive mail with link to set new password.
Back to login
You must be logged in to post a comment.