ALL GATE QUESTIONS SUBJECTWISE
×

Concepts of Layering

1 Mark Questions

Lan Technologies 
and Wifi

1 Mark Questions 2 Marks Questions

Data Link Layer and Switching

1 Mark Questions 2 Marks Questions

Network Layer (IPv4,IPv6)

1 Mark Questions 2 Marks Questions

Routing Algorithm

1 Mark Questions 2 Marks Questions

TCP/UDP, Sockets  and Congestion Control

1 Mark Questions 2 Marks Questions

Application Layer Protocol

1 Mark Questions 2 Marks Questions

Network Security

1 Mark Questions 2 Marks Questions



GATE 2014 Question - Mark 1

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 true, but S2 is false.


Total 2 Questions



Share: