GATE Computer Science (CS) 2014 Shift 1 Solved Paper

Question : 33 of 65

Marks: +1, -0

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?

S1, S2, and S3 are all true.
S1, S2, and S3 are all false
S1 and S2 are true, but S3 is false.
S1 and S3 are true, but S2 is false

Validate

Go to Question:

Prev Question

Next Question