M

Mr. Dubey • 52.77K 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
(C) both s1 and s2 are true
(D) s2 is true but s1 is false
Share
Explanation by: Mr. Dubey 
 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.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. “Cloud” in cloud computing represents what?

Q. A relation project guidance Project Guidance(professor, project, student no. st-name, dept) A professor can give many projects to many students A proj

Q. In white box testing what do you verify?

Q. Which among the following is the duties of the Data Nodes

Q. Which one is best in action between fork() and vfork()?

Q. Analyze, if the second instruction has data dependencies with the first, but the third instruction does not, the first

Q. Low frequency noise is

Q. Data can be changed from special code to temporal code by using

Q. Depreciation available, if the asset is used for less than 180 days during the year of acquisition shall be of block rate:

Q. What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the l

Question analytics