GATE CSE 2009 | Dynamic Programming Question 12 | Algorithms

GATE CSE 2009

MCQ (Single Correct Answer)

-0.6

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.

We wish to find the length of the longest common sub-sequence (LCS) of X[m] and Y[n] as l(m,n), where an incomplete recursive definition for the function I(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),l (i, j))

GATE CSE 2009

MCQ (Single Correct Answer)

-0.6

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]

The value 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)?

All elements of 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.

GATE CSE 2008

MCQ (Single Correct Answer)

-0.6

The subset-sum problem is defined as follows. Given a set of n positive integers, S = {a₁ ,a₂ ,a₃ ,…,a_n} and positive integer W, is there a subset of S whose elements sum to W? A dynamic program for solving this problem uses a 2-dimensional Boolean array X, with n rows and W+1 columns. X[i, j], 1 <= i <= n, 0 <= j <= W, is TRUE if and only if there is a subset of {a₁ ,a₂ ,…,a_i} whose elements sum to j.

Which entry of the array X, if TRUE, implies that there is a subset whose elements sum to W?

X[1, W]

X[n, 0]

X[n, W]

X[n-1, n]

GATE CSE 2008

MCQ (Single Correct Answer)

-0.6

The subset-sum problem is defined as follows. Given a set of n positive integers, S = {a₁ ,a₂ ,a₃ ,…,a_n} and positive integer W, is there a subset of S whose elements sum to W? A dynamic program for solving this problem uses a 2-dimensional Boolean array X, with n rows and W+1 columns. X[i, j], 1 <= i <= n, 0 <= j <= W, is TRUE if and only if there is a subset of {a₁ ,a₂ ,…,a_i} whose elements sum to j.
Which of the following is valid for 2 <= i <= n and ai <= j <= W?

X[i, j] = X[i – 1, j] V X[i, j -a_i]

X[i, j] = X[i – 1, j] V X[i – 1, j – a_i]

X[i, j] = X[i – 1, j] V X[i, j – a_i]

X[i, j] = X[i – 1, j] V X[i -1, j – a_i]

PREVIOUS NEXT