The subset-sum problem is defined as follows.
Given a set of n positive integers, S = 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 whose elements sum to j.
Which of the following is valid for 2 i n and a i j W ?

Question

The subset-sum problem is defined as follows.  
 Given a set of  n  positive integers,  S =    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      whose elements sum to  j.   
 Which of the following is valid for  2    i    n  and  a i     j    W ?

Answer

X[i, j] = X[i - 1, j] ∧ X[i, j - a i ]

Answer

X[i, j] = X[i - 1, j] ∨ X[i - 1, j - a i ]

Answer

X[i, j] = X[i - 1, j] ∨ X[i, j - a i ]

Crowdly

The subset-sum problem is defined as follows. Given a set of n positive int...

Want instant access to all verified answers on moodle.concordia.ca?