Which of the following statements is/are INCORRECT about the OSPF (Open Shortest Path First) routing protocol used in the Internet?
Topic-wise GATE CS PYQs with verified steps
GATE CSE 2023 · Q25
Time
Select all that applyOne or more correct
Solution
Official answer: A) OSPF implements Bellman-Ford algorithm to find shortest paths.; C) OSPF is used as an inter-domain routing protocol.
Distance Vector and Link-State RoutingOSPF (Open Shortest Path First) is an open-standard link-state routing protocol:
Statement (A) is INCORRECT: OSPF is a link-state routing protocol that utilizes Dijkstra's Shortest Path First (SPF) algorithm to compute the shortest path tree from the source router to all destination networks. The Bellman-Ford algorithm is used by Distance-Vector routing protocols such as RIP (Routing Information Protocol).
Statement (B) is CORRECT: Each router running OSPF builds a complete topological database of the network and runs Dijkstra's algorithm to compute the least-cost paths.
Statement (C) is INCORRECT: OSPF is an intra-domain (Interior Gateway Protocol - IGP) routing protocol used within an Autonomous System (AS). Inter-domain routing is typically handled by protocols such as BGP (Border Gateway Protocol).
Statement (D) is CORRECT: OSPF supports hierarchical routing by dividing an Autonomous System into multiple areas, with a central backbone area (Area 0) interconnecting non-backbone areas.
Therefore, the incorrect statements are A and C.
Try the question first, then check your work.
Examiner trap
Recall whether OSPF is a link-state or distance-vector protocol, whether it operates inside or between Autonomous Systems, and whether it supports multi-area architectures.
This Distance Vector and Link-State Routing previous year question is Q25 of the GATE CSE 2023 paper. Find more GATE CSE PYQs on Distance Vector and Link-State Routing in Computer Networks, or browse all GATE CSE PYQs.
Free diagnostic
Take the 20-minute diagnostic: the 3 topics that cost you the most marks, and a rank range. Or sit 5 related Distance Vector and Link-State Routing PYQs now with no account.
An official question by email at 7 AM IST, with a link to its verified solution. Unsubscribe in one click.
Distance Vector and Link-State Routing has 9 GATE CSE PYQs across 8 papers from 2011 to 2025. This is the only 1-mark MSQ among them, and it is the only one in GATE CSE 2023.
How GATE tests Distance Vector and Link-State RoutingIndependent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.