- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- What is the efficiency of Gale-Shapley a...

Q. |
## What is the efficiency of Gale-Shapley algorithm used in stable marriage problem? |

A. | o(n) |

B. | o(n log n) |

C. | o(n2) |

D. | o(log n) |

Answer» C. o(n2) | |

Explanation: the time efficiency of gale- shapley algorithm is mathematically found to be o(n2) where n denotes stable marriage problem. |

View all MCQs in:
Design and Analysis of Algorithms

- Can stable marriage cannot be solved using branch and bound algorithm.
- Stable marriage problem is an example of?
- Which of the following algorithms does Stable marriage problem uses?
- Who formulated a straight forward backtracking scheme for stable marriage problem?
- What is the prime task of the stable marriage problem?
- Which of the following problems is related to stable marriage problem?
- 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?
- Which of the following sorting algorithm is NOT stable?
- 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
- What is the time complexity of the brute force algorithm used to solve the assembly line scheduling problem?

Login to Continue

It will take less than 2 minutes

Report MCQ