Stable Marriage Problem Multiple choice Questions and Answers (MCQs)

YOU CAN DOWNLOAD 200+ SUBJECTS PDF BOOK FOR COMPETITIVE EXAMINATIONS

CLICK HERE TO DOWNLOAD

Stable Marriage Problem Multiple choice Questions and Answers (MCQs)

Question 11 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Who formulated a straight forward backtracking scheme for stable marriage problem?
A
McVitie and Wilson
B
Gale
C
Ford and Fulkerson
D
Dinitz
Question 11 Explanation: 
McVitie and Wilson formulated a much faster straight forward backtracking scheme for stable marriage problem. Ford and Fulkerson formulated Maximum flow problem.

Question 12 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Can stable marriage cannot be solved using branch and bound algorithm.
A
True
B
False
Question 12 Explanation: 
Stable marriage problem can be solved using branch and bound approach because branch and bound follows backtracking scheme with a limitation factor.

Question 13 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
What is the prime task of the stable marriage problem?
A
To provide man optimal solution
B
To provide woman optimal solution
C
To determine stability of marriage
D
To use backtracking approach
Question 13 Explanation: 
The prime task of stable marriage problem is to determine stability of marriage (i.e) finding a man and a woman who prefer each other to others.

Question 14 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Which of the following problems is related to stable marriage problem?
A
choice of school by students
B
N-queen problem
C
Arranging data in a database
D
Knapsack problem
Question 14 Explanation: 
choice of school by students is the most related example in the given set of options since both school and students will have a preference list.

Question 15 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
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)
Question 15 Explanation: 
The time efficiency of Gale-Shapley algorithm is mathematically found to be O(N2) where N denotes stable marriage problem.

There are 15 questions to complete.