GATE CS 2025 (Afternoon) — Question 17

Computer Networks (CN)Routing Protocols (Shortest Path, Flooding, Distance Vector, Link State Routing)MCQ1 mark · −1/3 if wrongEasy

Consider the routing protocols given in List-I and the names given in List-II: List-I (i) Distance vector routing (ii) Link state routing List-II (a) Bellman-Ford (b) Dijkstra For matching of items in List-I with those in List-II, which ONE of the following options is CORRECT?
  1. A
    (i) – (a) and (ii) – (b)
  2. B
    (i) – (a) and (ii) – (a)
  3. C
    (i) – (b) and (ii) – (a)
  4. D
    (i) – (b) and (ii) – (b)
Practise the full 2025-AN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkComputer Networks (Tanenbaum)Layers, routing, TCP/IP and error control, explained clearly.
Practise more on Routing Protocols (Shortest Path, Flooding, Distance Vector, Link State Routing)Timed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group