Skip to content

GATE CS 2010 Q55 — Routing Protocols: Shortest Path, Flooding, Distance Vector, Link State

Explain with AI

Consider a network with 66 routers R1R1 to R6R6 connected with links having weights as shown in the following diagram.

Suppose the weights of all unused links are changed to 22 and the distance vector algorithm is used again until all routing tables stabilize. How many links will now remain unused?

 

Choose one option
View answer

Answer: B

Worked explanation not available yet.

Free practice · Your answers on this page are not saved.

Published
Report a correction
Keep exploringMore Routing Protocols: Shortest Path, Flooding, Distance Vector, Link State questions