Suppose we have three items as shown in the following table, and suppose the capacity of the knapsack is 50 i.e. W = 50. Item Value Weight 1 60 10 2100 203 120 30 the optimal solution is to pick?
a) Items 1 and 2
b) Items 1 and 3
c) Items 2 and 3
d) None of these
The Knapsack problem belongs to the domain of........ Problems.
a) Optimization
b) NP Complete
c) Linear Solution
d) Sorting
For Chain Matrix Multiplication we cannot use divide and conquer approach because?
a) We do not know the optimum k
b) We use divide and conquer for sorting only
c) We can easily perform it in linear time
d) Size of data is not given
A p
a) O (q)
b) O (1)
c) O (n^2)
d) O (n^3)
If there are O (n^2) entries in edit distance matrix then the total running time is......
a) O (1)
b) O (n^2)
c) O (n)
d) O(n log n)
The edit distance between FOOD and MONEY is?
a) At most four
b) At least four
c) Exact four
d) Wrong
