M

Mr. Dubey • 52.30K Points
Coach 

Q. 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
Correct : Option (C)

Explanation: 
 in set partition problem we check whether a set can be divided into 2 subsets such that the sum of elements in each subset is equal. if such subsets are present then we print true otherwise false.

Share

Discusssion

Login to discuss.

Loading Comments....

Related MCQs

Q. The set of loosely connected computers are called as

Q. The second phase of A Priori algorithm is____________

Q. The ECL behaves as

Q. In crabbing protocol locking

Q. Which of these techniques is vital for creating cloud-computing centers

Q. The root of DNS tree is____

Q. -------- refers to the process of examining a business situation with the intent of improving it through better procedures and methods.

Q. A graph in which all vertices have equal degree is known as ____

Q. A process P1 has a period of 50 and a CPU burst of t1 = 25, P2 has a period of 80 and a CPU burst of 35., can the two processes be scheduled using the

Q. The active data warehouse architecture includes _________.