GATE CSE 2010 || Computer Networks || GATE Insights Version: CSE

Описание: Planning to take coaching on Unacademy
http://bit.ly/gate_unacademy
or
https://unacademy.com/
here is a code for 10% off PLUS1BPK1

Telegram Notification Group link:-
https://t.me/joinchat/X5egW_cvdt9kMGY1

Telegram discussion Group link:-
https://t.me/joinchat/VCyGUmVq8RNkMzhl

Downloads resources from here
https://education4fun.com/gate-cse/

MCQ (Single Correct Answer)
GATE CSE 2010
Consider a network with five nodes, N1 to N5, as shown below. 
The network uses a a Distance Vector Routing Distance Vector Routing protocol. Once the routes have stabilized, the distance vectors at different nodes are as following. N1:(0, 1, 7, 8, 4) N2:(1, 0, 6, 7, 3) N3:(7, 6, 0, 2, 6) N4:(8, 7, 2, 0, 4) N5:(4, 3, 6, 4, 0) Each distance vector is the distance of the best known path at that instance to nodes, N1 to N5, where the distance to itself is 0. Also, all links are symmetric and the cost is identical in both directions. In each round, all nodes exchange their distance vectors with their respective neighbours. Then all nodes update their distance vectors. In between two rounds, any change in cost of a link will cause the two incident nodes to change only that entry in their distance vectors. 
The cost of link N2-N3 reduces to 2 (in both directions). After the next round of update what will be the new distance vector at node, N3? (A) (3, 2, 0, 2, 5) (B) (3, 2, 0, 2, 6) (C) (7, 2, 0, 2, 5) (D) (7, 2, 0, 2, 6)