1
GATE CSE 2022
Numerical
+1
-0.33

Consider a network with three routers P, Q, R shown in the figure below. All the links have cost of unity.

GATE CSE 2022 Computer Networks - Routing Algorithm Question 1 English

The routers exchange distance vector routing information and have converged on the routing tables, after which the link Q-R fails. Assume that P and Q send out routing updates at random times, each at the same average rate. The probability of a routing loop formation (rounded off to one decimal place) between P and Q, leading to count-to-infinity problem, is _____________

Your input ____
2
GATE CSE 2014 Set 2
MCQ (Single Correct Answer)
+1
-0.3
Which one of the following is TRUE about the interior gateway routing protocols – Routing Information Protocol (RIP) and Open Shortest Path First (OSPF)?
A
RILP uses distance vector routing and OSPF uses link state routing
B
OSPF uses distance vector routing and RIP uses link state routing
C
Both RIP and OSPF use link state routing
D
Both RIP and OSPF use distance vector routing
3
GATE CSE 2014 Set 1
MCQ (Single Correct Answer)
+1
-0.3
Consider the following three statements about link state and distance vector routing protocols, for a large network with 500 network nodes and 4000 links

[S1] The computational overhead in link state protocols is higher than in distance vector protocols.
[S2] A distance vector protocol (with split horizon) avoids persistent routing loops, but not a link state protocol.
[S3] After a topology change, a link state protocol will converge faster than a distance vector protocol.

Which one of the following is correct about S1, S2, and S3?
A
S1, S2, and S3 are all true
B
S1, S2, and S3 are all false.
C
S1 and S2 are true, but S3 is false
D
S1 and S3 are true, but S2 is false.
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12