UTpaper

Free mock tests & test series

Question 152

Kruskal's algorithm is used to find a:

  1. AMinimum spanning tree
  2. BStrongly connected component
  3. CTopological order
  4. DShortest path from one source
Show answerHide answer

Correct answer: (A) Minimum spanning tree

Explanation

It picks the smallest edges that don't form a cycle.

From DSSSB TGT Computer Science Full Mock Test 3

This is question 152 of DSSSB TGT Computer Science Full Mock Test 3. See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.