Question
Consider a graph with vertices A, B, C, D and edges with
weights: (A,B)=1, (A,C)=7, (A,D)=10, (B,C)=3, (C,D)=4, (D,E)=2. (Assume E is another vertex). If you apply Kruskal's algorithm, what is the sequence of edges added to the Minimum Spanning Tree (MST)?Solution
The correct answer is A
In a certain code language, ‘FAVOUR’ is written as ‘GZWNVQ’. What will be the code for ‘RAISIN’ in that code language?
...What is the code for ‘Other’?
- ‘SCHOOL’ is related to ‘AFJMMQ’ in the same way as ‘EXPLAIN’ is related to ‘___’.
In a code language, ‘ LAPSE ’ is written as ' MYSOJ ' and ‘ DEFINE ’ is written as ‘ ECIESY ’. How will ' FINAL ' be written in that languag...
- In a certain code language, "SILVER" is written as “IVEORH", and "CLOUD" is written as "WFLOX". How will "GOLDEN" be written in that language?
In a certain code language, HAMMER is coded as 5 and MINOR is coded as 135. What is the code of word ‘DANCING’ in the same coding language?
...In a certain ode language, AL = 12, DIG = 252. What will be the code for FAR?
How can 'ban music growing' be coded in the given language?
In a certain code language, ‘MANNERS’ is written as '52' and ‘GAMING’ is written as '37'. How will ‘SURPRISE’ be written in that language?
The code “pl” represents patient of the following word?
