M

Mr. Dubey • 100.69K 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.

Related MCQs

Q. In layer, vulnerabilities are directly associated with physical access to networks and hardware.

Q. CISC stands for

Q. The misuse of system vulnerability is

Q. >>>2 * t

Q. print(len(numbers))

Q. Global Sensor Network is built for

Q. The DES Algorithm Cipher System consists of ____________rounds (iterations) each with a round key.

Q. Which view in architectural design shows the key abstractions in the system as objects or object classes?

Q. What is the binary equivalent of the decimal number 1011

Q. Which of the following determine the least- squares regression line?

Question analytics