The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
+10 votes

In a network of LANs connected by bridges, packets are sent from one LAN to another through intermediate bridges. Since more than one path may exist between two LANs, packets may have to be routed through multiple bridges. Why is the spanning tree algorithm used for bridge-routing?

  1. For shortest path routing between LANs

  2. For avoiding loops in the routing paths

  3. For fault tolerance

  4. For minimizing collisions

asked in Computer Networks by Veteran (69k points) | 931 views

4 Answers

+17 votes
Best answer
The answer is B.

Since, in a spanning tree, there is a unique path from a source to the destination, which avoids loops, since it is a tree, and contains all the nodes, since it is a spanning tree.
answered by Active (1.5k points)
selected by
is A wrong?
I guess the MST uses the shortest path to build the tree without forming the loop in the tree. Option A only deals with shortest path routing, which is i guess not appropriate as compared with option B which is more clear according to MST. If the option A was "For avoiding loops in the routing table using the shortest path" then this would have made somewhat sense
+5 votes
answered by Boss (7.4k points)
is this in syllabus of GATE18?
+2 votes
For avoiding loop we use spanning tree algorithm.
answered by Boss (8.4k points)
–2 votes
ans is b
answered by Junior (597 points)

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

33,593 questions
40,128 answers
38,389 users