πŸ“Š Design and Analysis of Algorithms
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
πŸ’¬ Discuss
βœ… Correct 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.


Explanation by: Mr. Dubey
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.

πŸ’¬ Discussion

πŸ“Š Question Analytics

πŸ‘οΈ
992
Total Visits
πŸ“½οΈ
3 y ago
Published
πŸŽ–οΈ
Mr. Dubey
Publisher
πŸ“ˆ
87%
Success Rate