Register

Spanning Tree Problem

713 views
0 0 votes

Consider the diagram shown where number of LANs are connected by bridges.In order to avoid the loops, these bridges arrange themselves into a spanning tree. The root bridge identified as bridge with least serial number. Next each bridge identifies a port through which it can forward packets to root bridge. If Multiple ports are there, the one which have lower index have the high priority.If Multiple bridges are there to forward a packet to a LAN, the one which is near to root bridge will get prefered and in that the one which has lowest ID will gets prefered.

What is depth first traversal spanning tree of bridges?

  1.   B1, B4, B2, B3, B5
  2.   B1, B4, B5, B2, B3
  3.   B1, B2, B4, B5, B3
  4.   B1, B2, B3, B5, B4

1 Answer

Voting & Accepting an answer helps improve the community
← Previous · Doubt OS - Round Rob...Next → · Spanning Tree Proble...
← Previous in category · GBN PROTOCOLNext in category → · Spanning Tree Proble...
Position:
Show:

Related questions

1 1 vote
1 1 answer
1.1k
1.1k views
Anirban Biswas asked Jan 7, 2017
1,070 views
Spanning Tree Problem
Consider the diagram shown where number of LANs are connected by bridges.In order to avoid the loops, these bridges arrange themselves into a spanning tree. The root brid...
2 2 votes
0 0 answers
1.2k
1.2k views
sandip_1999 asked May 11, 2022
1,185 views
Why does Kruskal's algorithm find the minimum spanning tree if it's greedy? Isn't a minimum spanning tree a global optimization problem? Isn't the point of being greedy is that there is a chance you won't find the most optimal solution? So how can Kruskal be able to find the minimum spanning tree while also being greedy?
Please can anyone tell me though Prim’s and Kruskal’s algorithms are greedy algorithms. Greedy algorithms always give local optimum solutions but how Prim’s and Kruskal’s...
1 1 vote
2 answers 2 answers
3.0k
3.0k views
pankaj_vir asked Mar 19, 2018
2,971 views
Minimum Spanning Tree Problem
Which of the following statement is correct?Kruskal algorithm produces the intermediate result is always forest while computing MST of given graph.Kruskal algorithm produ...
1 1 vote
0 0 answers
899
899 views
Na462 asked Feb 19, 2018
899 views
Minimum Spanning Tree Problem
Given a graph with positive and distinct edge weights. If I double or triple.. the edge weights then:- 1. Shortest path will remain same2. Mst will remain sameRight?Note ...