Data Structures Algorithms-II MCQs

Page No. 73

Which of the following algorithms does Stable marriage problem uses?


aGale-Shapley algorithm


b Dijkstra’s algorithm


cFord-Fulkerson algorithm


dPrim’s algorithm



Stable marriage problem is an example of?


aBranch and bound algorithm


bBacktracking algorithm


cGreedy algorithm


dDivide and conquer algorithm



Who was the first person to solve the maximum matching problem?


aJack Edmonds


bHopcroft


cKarp


dClaude Berge


View Answer Jack Edmonds

What is the efficiency of algorithm designed by Hopcroft and Karp?


aO(n+m)


bO(n(n+m)


cO(√n(n+m))


dO(n+2)


View Answer O(√n(n+m))

What is the total number of iterations used in a maximum- matching algorithm?


a[n/2]


b[n/3]


c[n/2]+n


d[n/2]+1


View Answer [n/2]+1

The problem of maximizing the sum of weights on edges connecting matched pairs of vertices is?


aMaximum- mass matching


bMaximum bipartite matching


cMaximum weight matching


dMaximum node matching



Which is the correct technique for finding a maximum matching in a graph?


aDFS traversal


bBFS traversal


cShortest path traversal


dHeap order traversal


View Answer BFS traversal

Which one of the following is an application for matching?


aProposal of marriage


bPairing boys and girls for a dance


cArranging elements in a set


dFinding the shortest traversal path



A matching M is maximal if and only if there exists no augmenting path with respect to M.


aTrue


bFalse


ceither A. or B.


d None of these


View Answer True

In a bipartite graph G=(V,U,E), the matching of a free vertex in V to a free vertex in U is called?


aBipartite matching


bCardinality matching


cAugmenting


dWeight matching


View Answer Augmenting

Goto Page No.

Page 73 of 149

Alphabetical MCQs Categories

Here below You find all kind of categories of MCQs in alphabetical order.


"Comprehensive Collection of MCQs: Alphabetically Organized by Subject"

"Discover an extensive collection of multiple-choice questions (MCQs) neatly categorized by subject from A to Z. This resource is designed for anyone eager to explore various topics in a straightforward and organized manner. Whether you're a student preparing for exams, an educator seeking supplementary materials, or simply curious about different subjects, this compilation offers a convenient way to learn and assess your knowledge. With questions arranged alphabetically, navigation is effortless, allowing you to delve into subjects of interest at your own pace. Engage, learn, and expand your understanding with this accessible and comprehensive repository of MCQs!"


BolPakistan

bolpakistan.com.pk includes Job Mcqs and Pak Mcqs is the Top Largest Mcqs Forum in World, in which you can read Mcqs of All Subjects, PPSC test preparation, FPSC, NTS and PPSC PAST PAPERS, PPSC PAST MCQS. A Collection of Repeated MCQs for JOBs seekers.

Copyright © 2024, Designed & Developed by BolPakistan