Routing and Switching MCQs with Answers
Practice important Routing and Switching MCQs with answers and explanations.
Multiple Choice Questions
Q911: Which command enables RIPv2 on a router in Packet Tracer?
- A: router rip
- B: router ospf
- C: router bgp
- D: router eigrp
View Answer
A
Q912: Fill in the blank: To prevent automatic summarization in RIPv2, use the command __________.
- A: no auto-summary
- B: auto-summary off
- C: disable-summary
- D: no summarize
View Answer
A
Q913: What does the command show ip protocols display after configuring RIPv2?
- A: Routing protocol details
- B: Routing table
- C: Interface status
- D: IP address configuration
View Answer
A
Q914: Fill in the blank: The command __________ verifies RIPv2 configurations and displays the routing table.
- A: show ip route
- B: show ip protocols
- C: show ip rip
- D: show rip routes
View Answer
A
Q915: Which of the following is a correct command to advertise networks in RIPv2?
- A: network [network address]
- B: ip network [network address]
- C: advertise [network address]
- D: network advertise [network address]
View Answer
A
Q916: Fill in the blank: To configure RIPv2, the command __________ is used to specify the version.
- A: version 2
- B: rip version 2
- C: protocol version 2
- D: set rip version 2
View Answer
A
Q917: Which command disables automatic summarization in RIPv2?
- A: no auto-summary
- B: auto-summary off
- C: disable-summary
- D: no summarize
View Answer
A
Q918: Fill in the blank: The command __________ is used to verify that RIPv2 updates are being sent correctly.
- A: debug ip rip
- B: show ip rip
- C: trace ip rip
- D: monitor ip rip
View Answer
A
Q919: What is the main algorithm used by link-state routing protocols to calculate the best path?
- A: Dijkstra's Shortest Path First (SPF) Algorithm
- B: Bellman-Ford Algorithm
- C: Floyd-Warshall Algorithm
- D: A* Algorithm
View Answer
A
Q920: Fill in the blank: Link-state routing protocols use __________ to determine the shortest path route.
- A: Dijkstra's SPF Algorithm
- B: Bellman-Ford Algorithm
- C: Floyd-Warshall Algorithm
- D: A* Algorithm
View Answer
A