- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- An optimal solution satisfying men’s pre...

Q. |
## An optimal solution satisfying men’s preferences is said to be? |

A. | man optimal |

B. | woman optimal |

C. | pair optimal |

D. | best optimal |

Answer» A. man optimal | |

Explanation: an optimal solution satisfying men’s preferences are said to be man optimal. an optimal solution satisfying woman’s preferences are said to be woman optimal. |

View all MCQs in:
Design and Analysis of Algorithms

- Recursive solution of subset sum problem is faster than dynamic problem solution in terms of time complexity.
- Recursive solution of Set partition problem is faster than dynamic problem solution in terms of time complexity.
- What is the optimal time required for solving the closest pair problem using divide and conquer approach?
- The optimal time obtained through divide and conquer approach using merge sort is the best case efficiency.
- Suppose you have coins of denominations 1,3 and 4. You use a greedy algorithm, in which you choose the largest denomination coin which is not greater than the remaining sum. For which of the following sums, will the algorithm produce an optimal answer?
- Recursion is a method in which the solution of a problem depends on
- Bellmann ford algorithm provides solution for problems.
- How many solution/solutions are available for a graph having negative weight cycle?
- Which of the following is true about the time complexity of the recursive solution of the subset sum problem?
- Which of the following is true about the time complexity of the recursive solution of set partition problem?

Login to Continue

It will take less than 2 minutes

Report MCQ