Consider the routing protocols given in List I and the names given in List II: For matching of items in List I with those in List II, which ONE of the following options is CORRECT?
Topic-wise GATE CS PYQs with verified steps
GATE CSE 2025 Set 2 · Q17
MCQ1 markEasy
Time
Consider the routing protocols given in List I and the names given in List II: For matching of items in List I with those in List II, which ONE of the following options is CORRECT?
Select one answerSingle correct
Pick an option to check
Solution
Step-by-step verified solution
Official answer: A) (i) – (a) and (ii) – (b)
Distance Vector and Link-State RoutingDistance Vector Routing (i): In distance vector routing protocols (such as RIP), each router computes the shortest path to all destinations using iterative, distributed calculations based on the Bellman-Ford algorithm (a). Routers periodically share their entire routing table only with immediate neighbors.
Link State Routing (ii): In link state routing protocols (such as OSPF), routers distribute the state of their individual links to all nodes in the domain via link-state advertisements (flooding). Once the global network topology is known, each router independently runs Dijkstra's algorithm (b) to compute the shortest paths to all destinations.
Thus, the correct matching is:
(i) (a)
(ii) (b)
Therefore, option (A) is correct.
Try the question first, then check your work.
Examiner trap
The misconception this question tests
Recall which routing protocol shares distance vectors with neighbors using the Bellman-Ford equation, and which one floods link states to build a complete topology graph and runs Dijkstra's shortest path algorithm.
This Distance Vector and Link-State Routing previous year question is Q17 of the GATE CSE 2025 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 2025 Set 2.
How GATE tests Distance Vector and Link-State RoutingMore from GATE CSE 2025 Set 2
- Q19Consider the following C program: #include void stringcopy(char *, char *); int main() { char a[30] = "@#Hello World!"; stringcopy(a, a + 2); printf("%s ", a);…MCQ1 markMedium
- Q15Let P(x) be an arbitrary predicate over the domain of natural numbers. Which ONE of the following statements is TRUE?MCQ1 markEasy
- Q20Consider an unordered list of N distinct integers. What is the minimum number of element comparisons required to find an integer in the list that is NOT the la…MCQ1 markEasy
- Q14Let L, M, and N be non-singular matrices of order 3 satisfying the equations L2 = L-1, M = L8 and N = L2. Which ONE of the following is the value of the determ…MCQ1 markEasy
Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.