Computer Networks MCQs with Answers
Practice important Computer Networks MCQs with answers and explanations.
Chapter: 17
Q561:
Static routing is considered ________.
A. Highly flexible
B. Fault tolerant
C. Inflexible
D. None of these
Correct Answer:
C
Chapter: 17
Q562:
Dynamic routing can ________.
A. only be set at boot time
B. handle failures automatically
C. require no software
D. only use manual updates
Correct Answer:
B
Chapter: 17
Q563:
Dijkstra’s algorithm is used to compute ________.
A. Shortest path in a network
B. Longest path in a graph
C. Spanning tree
D. Firewall rules
Correct Answer:
A
Chapter: 17
Q564:
Which algorithm accommodates weights on edges in a graph?
A. Floyd’s Algorithm
B. Kruskal’s Algorithm
C. Dijkstra’s Algorithm
D. Prim’s Algorithm
Correct Answer:
C
Chapter: 17
Q565:
The shortest path is the one with ________.
A. Minimum number of hops
B. Maximum number of edges
C. Minimum total weight
D. Direct connection
Correct Answer:
C
Chapter: 17
Q566:
In weighted graphs, weights represent ________.
A. Colors
B. Packet sizes
C. Costs like time or hops
D. Number of users
Correct Answer:
C
Chapter: 17
Q567:
What does distance in a weighted graph represent?
A. Time
B. Dollars
C. Hop count
D. All of the above
Correct Answer:
D
Chapter: 17
Q568:
In distance-vector routing, each switch sends routing messages to ________.
A. All devices
B. Only its neighbors
C. Main server
D. All endpoints
Correct Answer:
B
Chapter: 17
Q569:
The distance-vector algorithm updates routing tables based on ________.
A. Hardware status
B. Firewall configuration
C. Neighbor messages
D. Manual input
Correct Answer:
C
Chapter: 17
Q570:
What happens when a link or switch fails in dynamic routing?
A. Network shuts down
B. Nothing happens
C. It adapts to the failure
D. Manual reboot required
Correct Answer:
C
Chapter: 17
Q571:
Which algorithm is used in RIP protocol?
A. Link-state
B. Dijkstra
C. Distance-vector
D. Floyd-Warshall
Correct Answer:
C
Chapter: 17
Q572:
Which algorithm is used in OSPF protocol?
A. Distance-vector
B. Link-state
C. Static
D. RIP
Correct Answer:
B
Chapter: 17
Q573:
Link-state routing allows ________.
A. Local updates
B. Independent computations
C. Global table sharing
D. Manual table entry
Correct Answer:
B
Chapter: 17
Q574:
The main difference between distance-vector and link-state routing is ________.
A. Speed
B. Table structure
C. Route computation method
D. OS used
Correct Answer:
C
Chapter: 17
Q575:
Which protocol is simple and first updates its own routing table?
A. OSPF
B. Link-state
C. RIP
D. Static
Correct Answer:
C
Chapter: 17
Q576:
ARPANET was funded by ________.
A. Microsoft
B. Google
C. Advanced Research Project Agency
D. IBM
Correct Answer:
C
Chapter: 17
Q577:
Which of the following was a precursor to the Internet?
A. X.25
B. ARPANET
C. SMDS
D. ATM
Correct Answer:
B
Chapter: 17
Q578:
X.25 was designed for ________.
A. Email transmission
B. Video conferencing
C. Connection-oriented networking
D. Cloud computing
Correct Answer:
C
Chapter: 17
Q579:
Frame Relay is a ________.
A. Connectionless technology
B. Connection-oriented Telco service
C. Wireless service
D. Peer-to-peer protocol
Correct Answer:
B
Chapter: 17
Q580:
Which data rate is typical for Frame Relay?
A. 10 Gbps
B. 1 Mbps
C. 56 kbps to 100 Mbps
D. 10 Mbps
Correct Answer:
C