Which one of the following is TRUE about the interior gateway routing protocols – Routing Information Protocol (RIP) and Open Shortest Path First (OSPF)?
Topic-wise GATE CS PYQs with verified steps
GATE CSE 2014 Set 2 · Q23
MCQ1 markEasy
Time
Which one of the following is TRUE about the interior gateway routing protocols – Routing Information Protocol (RIP) and Open Shortest Path First (OSPF)?
Select one answerSingle correct
Pick an option to check
Solution
Step-by-step verified solution
Official answer: A) RIP uses distance vector routing and OSPF uses link state routing
Distance Vector and Link-State RoutingRouting Information Protocol (RIP) is based on the Distance Vector Routing algorithm (using the Bellman-Ford algorithm), where routers periodically exchange their entire routing tables with immediate neighbors.
Open Shortest Path First (OSPF) is based on the Link State Routing algorithm (using Dijkstra's Shortest Path First algorithm), where each router floods information about its local links to all routers in the autonomous system.
Therefore, (A) is the correct statement.
Try the question first, then check your work.
Examiner trap
The misconception this question tests
Recall which protocol uses the Bellman-Ford algorithm (hop count) and which uses Dijkstra's shortest path algorithm.
This Distance Vector and Link-State Routing previous year question is Q23 of the GATE CSE 2014 Set 2 paper. Find more GATE CSE PYQs on Distance Vector and Link-State Routing in Computer Networks, or browse all GATE CSE PYQs.
Free diagnostic
Where do you stand for GATE?
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.
One GATE CSE PYQ every morning
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 in GATE CSE
Distance Vector and Link-State Routing has 9 GATE CSE PYQs across 8 papers from 2011 to 2025. 4 of them are 1-mark MCQs like this one, and it is the only one in GATE CSE 2014 Set 2.
How GATE tests Distance Vector and Link-State RoutingMore from GATE CSE 2014 Set 2
- Q25In the diagram shown below, L1 is an Ethernet LAN and L2 is a Token-Ring LAN. An IP packet originates from sender S and traverses to R, as shown. The links wit…NAT1 markMedium
- Q21The maximum number of superkeys for the relation schema R (E, F, G, H) with E as the key is …NAT1 markEasy
- Q26Consider the store and forward packet switched network given below. Assume that the bandwidth of each link is 106 bytes / sec. A user on host A sends a file of…MCQ2 marksMedium
- Q20A FAT (file allocation table) based file system is being used and the total overhead of each entry in the FAT is 4 bytes in size. Given a 100 × 106 bytes disk…NAT1 markMedium
Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.