October 29, 2023
October 29, 2023
October 29, 2023
###### UGC-NET Dec 2019 Part-1
October 29, 2023

A sub-sequence of a given sequence is just the given sequence with some elements (possibly none or all) left out. We are given two sequences X[m] and Y[n] of lengths m and n respectively, with indexes of X and Y starting from 0.

The values of l(i,j) could be obtained by dynamic programming based on the correct recursive definition of l(i,j) of the form given above, using an array L[M,N], where M = m+1 and N=n+1, such that L[i,j] = l(i,j).

Which one of the following statements would be TRUE regarding the dynamic programming solution for the recursive definition of l(i,j)?

Question 7 Explanation:
LCS procedure can followed by either row major or column major order. We can get the same solution by any order. The above question looks very big but they are explaining the procedure of LCS.
All elements L should be initialized to 0 for the values of l(i,j) to be properly computed.
The values of l(i,j) may be computed in a row major order or column major order of L(M,N).
The values of l(i,j) cannot be computed in either row major order or column major order of L(M,N).
L[p,q] needs to be computed before L[r,s] if either p<r or="" q<s.=""