- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- What is the set partition problem?

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 Algorithms

- Given an array, check if the array can be divided into two subsets such that the sum of elements of the two subsets is equal. This is the balanced partition problem. Which of the following methods can be used to solve the balanced partition problem?
- Recursive solution of Set partition problem is faster than dynamic problem solution in terms of time complexity.
- What is the worst case time complexity of dynamic programming solution of set partition problem(sum=sum of set elements)?
- What will be the auxiliary space complexity of dynamic programming solution of set partition problem(sum=sum of set elements)?
- Which of the following is true about the time complexity of the recursive solution of set partition problem?
- What is the time complexity of the brute force algorithm used to solve the balanced partition problem?
- The longest increasing subsequence problem is a problem to find the length of a subsequence from a sequence of array elements such that the subsequence is sorted in increasing order and it’s length is maximum. This problem can be solved using
- Given a rod of length n and the selling prices of all pieces smaller than equal to n, find the most beneficial way of cutting the rod into smaller pieces. This problem is called the rod cutting problem. Which of these methods can be used to solve the rod cutting problem?
- A complete bipartite graph is a one in which each vertex in set X has an edge with set Y. Let n be the total number of vertices. For maximum number of edges, the total number of vertices hat should be present on set X is?
- If a problem can be broken into subproblems which are reused several times, the problem possesses property.

Login to Continue

It will take less than 2 minutes

Report MCQ