What is the set partition problem? – McqOptions

MCQOPTIONS

1.	What is the set partition problem?
A.	finding a subset of a set that has sum of elements equal to a given number
B.	checking for the presence of a subset that has sum of elements equal to a given number
C.	checking whether the set can be divided into two subsets of with equal sum of elements and printing true or false based on the result
D.	finding subsets with equal sum of elements
Answer» D. finding subsets with equal sum of elements

Discussion

No Comment Found

Related MCQs

Under what case of Master’s theorem will the recurrence relation of stooge sort fall?
Matrix A is of order 3*4 and Matrix B is of order 4*5. How many elements will be there in a matrix A*B multiplied recursively.
What is the distance between the lines 3x- 4y+7=0 and 3x-4y+5=0?
Cross product of two vectors can be used to find?
What is the auxiliary space complexity of Z algorithm for pattern searching (m = length of text, n = length of pattern)?
Which of the following operation will give a vector that is perpendicular to both vectors a and b?
What is the result of the recurrences which fall under second case of Master’s theorem (let the recurrence be given by T(n)=aT(n/b)+f(n) and f(n)=nc?
Under what case of Master’s theorem will the recurrence relation of merge sort fall?
What will be the slope of the line given by ax + by + c = 0?
What is the average running time of a quick sort algorithm?