Learn with Anil · TGPSC HMWSSB Manager (Engineering) PYQsPractise online →Subscribe ₹149

TGPSC HMWSSB Manager 2015 Paper 2 CSE · Question 50

Question 50 of the TSPSC Manager (Engineering), HMWSSB, 2015: Paper 2 (Computer Science & Information Technology) (1 November 2015). Try it first, then open the answer. The explanation is in the practice app with the All-in-One Pass.

  1. Manager 2015 Paper 2 (CS & IT) · Q50 · Algorithms · Graph Algorithms

    What is the time complexity of Kruskal's algorithm for finding the minimum spanning tree of an undirected graph containing n vertices and m edges?

    1. O(n)
    2. O(m + n)
    3. O(n²)
    4. O(m log n)
    Show answer

    Answer: (4) O(m log n)

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

Answer it in the practice appMake a topic-wise quiz