M

Mr. Dubey • 52.26K Points
Coach 

Q. A matching that matches all the vertices of a graph is called?

(A) perfect matching
(B) cardinality matching
(C) good matching
(D) simplex matching
Correct : Option (A)

Explanation: 
 a matching that matches all the vertices of a graph is called perfect matching.

Share

Previous

Next

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. What are the characteristics of data migration?

Q. A primary goal of software engineering is to improve the -------------and to increase the productivity and job satisfaction of software engineers.

Q. In which testing level the focus is on customer usage?

Q. After two clock pulses, the register contains

Q. The truth table for an S-R flip-flop has how many VALID entries?

Q. Refinement is a process of

Q. scheme that records only information about dirty pages and associated information and does not even require of writing dirty page

Q. After each circuit in a subsection of a VHDL program has been , they can be combined and the subsection can be tested.

Q. In RDBMS, Data is presented as a collection of............

Q. Reverse engineering techniques for internal program data focus on the definition of classes of objects.