Consider the data given in above question. Suppose the weights of all unused links in the previous question are changed to 2 and the distance vector algorithm is used again until all routing tables stabilize. How many links will now remain unused?
(A) 0
(B) 1
(C) 2
(D) 3
Answer: (B)
Explanation: See question 4 of https://www.geeksforgeeks.org/computer-networks-set-4-2/amp/
Quiz of this Question
GATE | GATE CS 2010 | Question 55
Recommended Articles