M

Mr. Dubey • 100.69K Points
Coach

Q. From the given graph, how many vertices can be matched using maximum matching in bipartite graph algorithm?

  • (A) 5
  • (B) 4
  • (C) 3
  • (D) 2
Share
Explanation by: Mr. Dubey
one of the solutions of the matching problem is given by a-w,b-v,c-x,d- y,e-z. hence the answer is 5.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. What is the output of the following program? from math import sqrt L1 = [x**2 for x in range(10)].pop() L1 + = 19 print(sqrt(L1), end = " ")

Q. What effect would have on the break-even point and expected profit if there is an increase in fixed cost?

Q. Which of the following must be estimated for performance analysis?

Q. At what organisational level is it necessary to balance strategic actions with environmental and resource conditions?

Q. An accuracy is

Q. On assigning a value to a variable inside a function, it automatically becomes a global variable.

Q. Which of the following gives a logical structure of the database graphically?

Q. How many AND gates are required to realize Y = CD + EF + G?

Q. What is a multiplexer?

Q. To produce a good quality product, process should be

Question analytics