This topic contains 0 replies, has 0 voices, and was last updated by  EduGorilla 1 year, 11 months ago.

  • Author
    Posts
  • #1440086 Reply
     EduGorilla 
    Keymaster
    Select Question Language :


    Prim’s algorithm is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized Let G be a graph with V vertices and E edges. Let X be the time complexity of prim’s algorithm using array and y be the time complexity of prism algorithm using binary heap. What is the value of X and Y respectively?

    Options :-

    1. O(V3) and O(E log V)
    2. O(V2) and O(E log V)
    3. O(E log V) and O(VE)
    4. O(E log V) and O(V2)
    Post your Training /Course Enquiry
    Are You looking institutes / coaching center for
    • IIT-JEE, NEET, CAT
    • Bank PO, SSC, Railways
    • Study Abroad
    Select your Training / Study category
Reply To: Prim’s algorithm is a greedy algorithm that finds a minimum spanning tree for a weighted undirected ….
Your information:




Verify Yourself




Log in with your credentials

or    

Forgot your details?

Create Account