M

Mr. Dubey • 53.58K 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. One of the major drawbacks to the use of asynchronous counters is that

Q. Magnetic tape drives can write data at a speed disk drives.

Q. You are given infinite coins of N denominations v1, v2, v3,…..,vn and a sum S. The coin change problem is to find the minimum number of coins r

Q. The bandwidth of OQPSK is to QPSK.

Q. The variables in the triggers are declared using

Q. In a comparator, if we get input as A>B then the output will be

Q. +2j)

Q. displays of data such as maps, charts and other graphical representation allow data to be presented compactly to the users.

Q. Which one of the following is not a financial incentive?

Q. In a client server network, the ports in the range of 0 to 1023 are called ports.

Question analytics