No Explaination.

No Explaination.

No Explaination.

Which of the following is NOT the sequence of edges added to the minimum spanning tree using
Kruskal’s algorithm?

No Explaination.

No Explaination.

No Explaination.

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 option is correct?

No Explaination.

No Explaination.

No Explaination.

No Explaination.