Register

Test by Bikram | Algorithms | Test 2 | Question: 20

• edited by
413 views

1 Answer

Best answer
3 votes
3 votes

Edges included in all MST's are - EH,EI,FI

Remaining Edges - 

MST 1 - FG,GJ

MST 2 - IJ,GJ

MST 3 - FG ,IJ

MST 4 - IG,IJ

MST 5 - IG ,GJ

• selected by
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
2 answers
2
Bikram asked May 26, 2017
374 views
Test by Bikram | Algorithms | Test 2 | Question: 28
Assume Dijkstra's Algorithm is used to find the shortest paths from node G in the above graph. The total number of edges which are not included in any of the shortest paths from node G are _________.
Assume Dijkstra's Algorithm is used to find the shortest paths from node G in the above graph. The total number of edges which are not included in any of the shortest pat...
User Avatar
1 votes
1 votes
2 answers
3
Bikram asked May 26, 2017
493 views
Test by Bikram | Algorithms | Test 2 | Question: 27
The total number of LCS (Longest Common Subsequences) of $P = abcd123$ and $Q= badc321$ that can be formed are ______.
The total number of LCS (Longest Common Subsequences) of $P = abcd123$ and $Q= badc321$ that can be formed are ______.
User Avatar
0 votes
0 votes
1 answer
4
Bikram asked May 26, 2017
337 views
Test by Bikram | Algorithms | Test 2 | Question: 26
Consider the following instance of the knapsack problem : ... above weights and benefits of items, if we need an optimal solution of fractional knapsack problem, the value of maximum benefit will be ______.
Consider the following instance of the knapsack problem :$\begin{array}{|c|c|c|c|c|c|} \hline \text{Item} & a & b & c & d & e \\ \hline \text{Benefit} & 15 & 12 & 9 & 16 ...
User Avatar
Link Copied!