- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Which one of the following is an applica...

Q. |
## Which one of the following is an application for matching? |

A. | proposal of marriage |

B. | pairing boys and girls for a dance |

C. | arranging elements in a set |

D. | finding the shortest traversal path |

Answer» B. pairing boys and girls for a dance | |

Explanation: pairing boys and girls for a dance is a traditional example for matching. proposal of marriage is an application of stable marriage problem. |

View all MCQs in:
Design and Analysis of Algorithms

- Maximum matching is also called as maximum cardinality matching.
- Which graph has a size of minimum vertex cover equal to maximum matching?
- Which theorem gives the relation between the minimum vertex cover and maximum matching?
- Which is the correct technique for finding a maximum matching in a graph?
- is a matching with the largest number of edges.
- A matching that matches all the vertices of a graph is called?
- In a bipartite graph G=(V,U,E), the matching of a free vertex in V to a free vertex in U is called?
- A matching M is maximal if and only if there exists no augmenting path with respect to M.
- Who was the first person to solve the maximum matching problem?
- From the given graph, how many vertices can be matched using maximum matching in bipartite graph algorithm?

Login to Continue

It will take less than 2 minutes

Report MCQ