Which algorithm finds the Minimum Spanning Tree by selecting edges in…

PYQ IBPS SO CRP SPL-XV (2025)

Which algorithm finds the Minimum Spanning Tree by selecting edges in increasing order of weight?

  1. A.

    Prim’s Algorithm

  2. B.

    Dijkstra’s Algorithm

  3. C.

    Kruskal’s Algorithm

  4. D.

    Floyd-Warshall Algorithm

  5. E.

    Bellman-Ford Algorithm

Attempted by 72 students.

Sign up free to check your answer

Sign up free

Explore the full course: Ibps So It Mains

Loading lesson…