Gate CS-2014-1 Question Paper With Solutions

Q. 33 Consider the following three statements about link state and distance vector routing protocols, for a large network with 500 network nodes and 4000 links.

[S1] The computational overhead in link state protocols 
     is higher than in distance vector protocols.
[S2] A distance vector protocol (with split horizon) 
     avoids persistent routing loops, but not a link
     state protocol.
[S3] After a topology change, a link state protocol 
     will converge faster than a distance vector
     protocol.

Which one of the following is correct about S1, S2 and S3?

(A) S1, S2 and S3 are all true

(B) S1, S2 and S3 are all false

(C) S1 and S2 are true, but S3 is false

(D) S1 and S3 are ture, but S2 is false

Answer: (D)

Explanation:

Gate CS-2014-1 Question Paper With Solutions Gate CS-2014-1 Question Paper With Solutions

Learn More:   Gate ME 2015-3 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here