Computer Networks MCQs with Answers
Practice important Computer Networks MCQs with answers and explanations.
Multiple Choice Questions
Q561: Static routing is considered ________.
- A: Highly flexible
- B: Fault tolerant
- C: Inflexible
- D: None of these
View Answer
C
Q562: Dynamic routing can ________.
- A: only be set at boot time
- B: handle failures automatically
- C: require no software
- D: only use manual updates
View Answer
B
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
View Answer
A
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
View Answer
C
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
View Answer
C
Q566: In weighted graphs, weights represent ________.
- A: Colors
- B: Packet sizes
- C: Costs like time or hops
- D: Number of users
View Answer
C
Q567: What does distance in a weighted graph represent?
- A: Time
- B: Dollars
- C: Hop count
- D: All of the above
View Answer
D
Q568: In distance-vector routing, each switch sends routing messages to ________.
- A: All devices
- B: Only its neighbors
- C: Main server
- D: All endpoints
View Answer
B
Q569: The distance-vector algorithm updates routing tables based on ________.
- A: Hardware status
- B: Firewall configuration
- C: Neighbor messages
- D: Manual input
View Answer
C
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
View Answer
C