- Which value is indicated by the next hop in a routing table?
- A. preference of the route source
- B. IP address of the remote router for forwarding the packets
- C. how the route was learned
- D. exit interface IP address for forwarding the packets
- Which component of the routing table ranks routing protocols according to their preferences?
- A. administrative distance
- B. next hop
- C. metric
- D. routing protocol code
Show (Hide) Explanation/ReferenceThe administrative distance of each protocol is compared to see if that route is better or not. - Which route source code represents the routing protocol with a default administrative distance of 90 in the routing table?
- A. S
- B. E
- C. D
- D. R
- E. O
Show (Hide) Explanation/ReferenceLetter “D” is used to symbolize for EIGRP (with a default AD of 90). Letter “E” is not used for EIGRP because it has been used for Exterior Gateway Protocol (EGP). It is a obsolete routing protocol now. - When enabled, which feature prevents routing protocols from sending hello messages on an interface?
- A. virtual links
- B. passive-interface
- C. directed neighbors
- D. OSPF areas
- Which path does a router choose when it receives a packet with multiple possible paths to the destination over different routing protocols?
- A. the path with both the lowest administrative distance and the highest metric
- B. the path with the lowest administrative distance
- C. the path with the lowest metric
- If a route is not present in the routing table for a particular destination, what would the router do?
- A. Default route
- B. Flood
- C. Drop
- When a device learns multiple routes to a specific network, it installs the route with?
- A. longest bit match (highest subnet mask)
- B. lowest AD
- C. lowest metric
- D. equal load balancing
Show (Hide) Explanation/ReferenceMaking a forwarding decision actually consists of three sets of processes: the routing protocols, the routing table, and the actual process which makes a forwarding decision and switches packets. The longest prefix match always wins among the routes actually installed in the routing table, while the routing protocol with the lowest administrative distance always wins when installing routes into the routing table. - When a router is unable to find a known route in the routing table, how does it handle the packet?
- A. It discards the packet
- B. It sends the packet over the route with the best metric
- C. It sends the packet to the next hop address
- D. It sends the packet to the gateway of last resort
Show (Hide) Explanation/Reference - If router R1 knows a static route to a destination network and then learns about the same destination network through a dynamic routing protocol, how does R1 respond?
- A. It refuses to advertise the dynamic route to other neighbors
- B. It sends a withdrawal signal to the neighboring router
- C. It disables the routing protocol
- D. It prefers the static route
CCNA 200-125 Exam: IP Routing 2 With Answers
0 Corrections & Clarifications

