- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- In case of stability, how many symmetric...

Q. |
## In case of stability, how many symmetric possibilities of trouble can occur? |

A. | 1 |

B. | 2 |

C. | 4 |

D. | 3 |

Answer» B. 2 | |

Explanation: possibilities- there might be a woman pw, preferred to w by m, who herself prefers m to be her husband and the same applies to man as well. |

View all MCQs in:
Design and Analysis of Algorithms

- Worst case is the worst case time complexity of Prim’s algorithm if adjacency matrix is used?
- Which case of master’s theorem can be extended further?
- How many approaches can be applied to solve quick hull problem?
- From the given graph, how many vertices can be matched using maximum matching in bipartite graph algorithm?
- Which of the following takes O(n) time in worst case in array implementation of stack?
- Which of the following sorting algorithm has best case time complexity of O(n2)?
- What will be the best case time complexity of recursive selection sort?
- What is the average case time complexity of recursive selection sort?
- What is the result of the recurrences which fall under second case of Master’s theorem (let the recurrence be given by T(n)=aT(n/b)+f(n) and f(n)=nc?
- What is the result of the recurrences which fall under third case of Master’s theorem (let the recurrence be given by T(n)=aT(n/b)+f(n) and f(n)=nc?

Login to Continue

It will take less than 2 minutes

Report MCQ