- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Under what condition any set A will be a...

Q. |
## Under what condition any set A will be a subset of B? |

A. | if all elements of set b are also present in set a |

B. | if all elements of set a are also present in set b |

C. | if a contains more elements than b |

D. | if b contains more elements than a |

Answer» B. if all elements of set a are also present in set b | |

Explanation: any set a will be called a subset of set b if all elements of set a are also present in set b. so in such a case set a will be a part of set b. |

View all MCQs in:
Design and Analysis of Algorithms

- Under what condition can a vertex combine and distribute flow in any manner?
- 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?
- What is a subset sum problem?
- Which of the following is true about the time complexity of the recursive solution of the subset sum problem?
- Subset sum problem is an example of NP- complete problem.
- Recursive solution of subset sum problem is faster than dynamic problem solution in terms of time complexity.
- Which of the following is not true about subset sum problem?
- Which type of graph has all the vertex of the first set connected to all the vertex of the second set?
- What is meant by the power set of a set?
- What is the worst case time complexity of dynamic programming solution of set partition problem(sum=sum of set elements)?

Login to Continue

It will take less than 2 minutes

Report MCQ