- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- What is meant by the power set of a set?

Q. |
## What is meant by the power set of a set? |

A. | subset of all sets |

B. | set of all subsets |

C. | set of particular subsets |

D. | an empty set |

Answer» B. set of all subsets | |

Explanation: power set of a set is defined as the set of all subsets. ex- if there is a set s= |

View all MCQs in:
Design and Analysis of Algorithms

- 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?
- Which type of graph has all the vertex of the first set connected to all the vertex of the second set?
- 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)?
- Recursive program to raise an integer x to power y uses which of the following algorithm?
- What is the least time in which we can raise a number x to power y?
- What is the advantage of iterative code for finding power of number over recursive code?
- Recursive approach to find power of a number is preferred over iterative approach.
- Kruskal’s algorithm can efficiently implemented using the disjoint-set data structure.
- For every rod cutting problem there will be a unique set of pieces that give the maximum price.

Login to Continue

It will take less than 2 minutes

Report MCQ