M

Mr. Dubey • 52.26K Points
Coach 

Q. Consider the following graph. Using Kruskal’s algorithm, which edge will be selected first?

(A) gf
(B) de
(C) be
(D) bg
Correct : Option (C)

Explanation: 
 in krsuskal’s algorithm the edges are selected and added to the spanning tree in increasing order of their weights.

Share

Previous

Next

Discusssion

Login to discuss.

Related MCQs

Q. can detect burst error of length less than or equal to degree of the polynomial and detects burst errors that affect odd number of bits.

Q. program, i.e., each thread executes the same code.

Q. Standard set of functions through which interacts with kernel is defined by

Q. If an Indirect approach is taken, then the sizing approach is represented as

Q. ) print(i)

Q. Retirement phase is

Q. Which of the following is true about constructors? 1) They cannot be virtual. 2) They cannot be private. 3) They are automatically called by new opera

Q. Mouse is replacement of .

Q. Which of the following algorithms are probably correct as well as fast?

Q. How buffers are enabled in the parallel ports?