McqMate
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 |
Answer» 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 | |
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. |
View all MCQs in
Design and Analysis of AlgorithmsNo comments yet