Question
Which algorithm is a greedy algorithm used to find the
Minimum Spanning Tree (MST) of a graph by repeatedly adding the smallest weight edge that connects two disconnected components?Solution
Kruskal's Algorithm is a greedy algorithm for finding an MST. It sorts all the edges in non-decreasing order of their weights and then adds edges one by one to the MST if they do not form a cycle with the already added edges. Prim's Algorithm is also greedy but builds the MST by growing a single component.
Read the given statements and conclusions carefully. Assuming that the information given in the statements is true, even if it appears to be at variance...
Ram and Shyam started together from same point. Ram walked 5 metres towards the East direction and Shyam walked 12 metres towards the North Direction ....
If ‘J @ I % H # G & F’, then how is I related to F?
Select the figure that will replace the question mark (?) in the following figure series.
Five colleagues, Chand, Chandini, Nidhi, Vikram and Ajay, are sitting in a row facing north. Nidhi and Chandini occupy the extreme ends of the row. Vikr...
Select the option that is related to the third word in the same way as the second word is related to the first word.
Bicycle : Pedal :: Car:?
What should come in place of the question mark (?) in the given series?
7 12 16 30 34 66 70 ?
Neeta is teaching relations to her daughter. She says, "How is my mother's mother's daughter-in-law's daughter related to me?" What will be the correct...
UPSET : SETUP :: TITPOT : ?
Select the option figure in which given figure is embedded. (Rotation is NOT allowed)
