Computer Networks
Concepts of Layering
Marks 1Marks 2
Data Link Layer and Switching
Marks 1Marks 2
Network Layer
Marks 1Marks 2
Application Layer Protocol
Marks 1Marks 2
Routing Algorithm
Marks 1Marks 2
TCP UDP Sockets and Congestion Control
Marks 1Marks 2
Lan Technologies and Wi-Fi
Marks 1Marks 2
Network Security
Marks 1Marks 2
1
GATE CSE 2010
MCQ (Single Correct Answer)
+2
-0.6

Consider a network with 6 routers R1 to R6 connected with links having weights as shown in the following diagram

GATE CSE 2010 Computer Networks - Routing Algorithm Question 8 English Suppose the weights of all unused links in the previous question are changed to 2 and the distance vector algorithm is used again until all routing tables stabilize. How many links will now remain unused?
A
$$0$$
B
1
C
2
D
3
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Digital Logic
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages
Computer Organization