Kruskal’s algorithm can efficiently implemented using the disjoint-set data structure.

Mr. Dubey • 52.30K Points
Coach

Q. Kruskal’s algorithm can efficiently implemented using the disjoint-set data structure.

(A) s1 is true but s2 is false

(B) both s1 and s2 are false

(D) s2 is true but s1 is false

Correct : Option (D)

Explanation:

 in kruskal’s algorithm, the disjoint-set data structure efficiently identifies the components containing a vertex and adds the new edges. and kruskal’s algorithm always finds the mst for the connected graph.

Discusssion

Be the first to start discuss.

Q. Automaton accepting the regular expression of any number of a ' s is:

Q. If 5 files are transferred from server A to client B in the same session. The number of TCP connection between A and B is:

Q. Requirement Engineering process does not involves

Q. Which of the following is not an example of 'structure?

Q. Parallelizing the two n-body solvers using _______________ is very similar to parallelizing them using OpenMP.

Q. Which symbol will be used with grep command to match the pattern pat at the end of a line?

Q. The major disadvantage of RAM is?

Q. RISC stands for

Q. Which term is used when signals move from one line to another?

Q. Kruskal’s algorithm can efficiently implemented using the disjoint-set data structure.

Discusssion

Related MCQs