Home / Engineering / Design and Analysis of Algorithms / Question

M

Mr. Dubey • 51.43K Points
Coach

Q.) When is a graph said to be bipartite?

(A) if it can be divided into two independent sets a and b such that each edge connects a vertex from to a to b
(B) if the graph is connected and it has odd number of vertices
(C) if the graph is disconnected
(D) if the graph has at least n/2 vertices whose degree is greater than n/2
Correct answer : Option (A) - if it can be divided into two independent sets a and b such that each edge connects a vertex from to a to b

Explanation:
 a graph is said to be bipartite if it can be divided into two independent sets a and b such that each edge connects a vertex from a to b.

Share

Discusssion

Login to discuss.

Related MCQs on Design and Analysis of Algorithms


Q. State the proper opinion : A key design issues for conyext aware system is to balance the degree of user management and awareness of proper environment.

Q. This unsupervised clustering algorithm terminates when mean values computed for the current iteration of the algorithm are identical to the computed mean values for the previous iteration.

Q. Gene Research, Inc. just finished a 4-year R&D and clinical trials successfully and expects a quick approval from the Food and Drug Administration. If the company markets the product on their own, it requires $30 million immediately (n ⇓ = ⇓ 0) to build a new manufacturing facility, and it is expected to have a 10 year product life. The R&D expenditure in the previous years and the anticipated revenues that the company can generate over the next 10 years is summarized as follows:Merck, a large drug company is interested in purchasing the R&D project and the right to commercialize the product from Gene Research, Inc., immediately (nD =D 0). What would be a starting negotiating price for the project from Merck? Assume that Gene’s MARR ⇓ = 20%.

Q. what is use of ls command ?

Q. Which is not a MOSFET terminal?

Q. After the kernel is brought in from disk into main memory, it begins execution and one of the first things it does is …………

Q. The FP-growth algorithm has phases

Q. The Boolean expression Y = (AB)’ is logically equivalent to what single gate?

Q. Managed code .......

Q. According to , it's a key success factor for the survival and evolution of all species.