M

Mr. Dubey • 52.77K Points
Coach 

Q. Which of the following edges form minimum spanning tree on the graph using kruskals algorithm?

(A) (b-e)(g-e)(e-f)(d-f)
(B) (b-e)(g-e)(e-f)(b-g)(d-f)
(C) (b-e)(g-e)(e-f)(d-e)
(D) (b-e)(g-e)(e-f)(d-f)(d-g)
Share
Explanation by: Mr. Dubey 
 using krushkal’s algorithm on the given graph, the generated minimum spanning tree is shown below.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. Diode–transistor logic (DTL) is the direct ancestor of

Q. What is true about Backward State Space Planning?

Q. The PDA is called non-deterministic PDA when there are more than one out going edges from……… state

Q. The word _______ denotes a function, a task, a discipline.

Q. What is the time complexity of evaluation of postfix expression algorithm?

Q. ____________ is a loss in the purchasing power of money over time.

Q. The must design and program the overlay structure.

Q. Two processors A and B have clock frequencies of 700 Mhz and 900 Mhz respectively. Suppose A can execute an instruction with an average of 3 steps and

Q. A control model where one system component is designed as system manager which controls the starting, stopping and coordination other system processes

Q. Offline device is

Question analytics