Homechevron_rightEngineeringchevron_rightComputer Sciencechevron_rightData Structurechevron_rightIf we choose Prim's Algorithm for uniquely weighted spanning tree inst...

If we choose Prim's Algorithm for uniquely weighted spanning tree inst...

  • Q. If we choose Prim's Algorithm for uniquely weighted spanning tree instead of Kruskal's Algorithm, then
  • filter_dramaExplanation
    Answer is : B
    None.

Discussion

    No one started the discussion yet. Break the ice and start the conversation.
    Please Login to be part of the discussion.

Similar Questions

  • 1. After applying the below operations on a input sequence, what happens?

    i. construct a cartesian tree for input sequence

    ii. put the root element of above tree in a priority queue

    iii. if( priority queue is not empty) then

    .search and delete minimum value in priority queue

    .add that to output

    .add cartesian tree children of above node to priority queue
  • filter_dramaExplanation
    Answer is : B
    None.
  • 2. When representing any algebraic expression E which uses only binary operations in a 2-tree,
  • filter_dramaExplanation
    Answer is : A
    None.
  • 3. If we choose Prim's Algorithm for uniquely weighted spanning tree instead of Kruskal's Algorithm, then
  • filter_dramaExplanation
    Answer is : B
    None.
  • 4. What maximum difference in heights between the leafs of a AVL tree is possible?
  • filter_dramaExplanation
    Answer is : A
    None.
  • 5. Which concept is useful while writing programming code for implementing various operations on trees?
  • filter_dramaExplanation
    Answer is : A
    None.

Data StructureTopics

leaderboardLeaderboard
  • Rahul Kumar

    191 Points

  • VIKRAM JEET

    54 Points

  • GEETHIKA CHOWDARY

    53 Points

  • sunita saini

    52 Points

  • Zain

    49 Points