Computer Networks · Distance Vector and Link-State Routing
Official IIT answer key · IIT Roorkee · Audited Aug 2026
GATE CSE 2017 Set 2 Q9 · MCQ · 1 mark
Key concept
No account needed
Sit 5 related Distance Vector and Link-State RoutingPYQs as a guest. We'll score the set and show which traps cost marks — sign in only if you want to save the run.
Topic notes
GATE tests Distance Vector (DVR) and Link State Routing (LSR) through two primary lenses: step-by-step mathematical trace of Bellman-Ford vector updates and conceptual comparison of protocol implementations (RIP vs. OSPF). 2-mark questions focus on iterative distance vector computations after link cost changes or link failures, including routing loop and count-to-infinity dynamics. 1-mark questions evaluate protocol architecture, transport layer encapsulation, algorithmic complexity, and convergence properties.
Full Distance Vector and Link-State Routing guide →Consider the following statements about the routing protocols, Routing Information Protocol (RIP) and Open Shortest Path First (OSPF) in an IPv4 network. I: RIP uses distance vector routing II: RIP packets are sent using UDP III: OSPF packets are sent using TCP IV: OSPF operation is based on link-state routing Which of the statements above are CORRECT?
Topic-wise GATE CS PYQs with verified steps
Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.
