CCNA FAQ: IPv4 Routing Protocol Concepts
Q1. Which of the following distance vector features prevents routing loops by causing the routing protocol to advertise only a subset of known routes, as opposed to the full routing table, under normal stable conditions?
a. Route poisoning
b. Dijkstra SPF
d. Split horizon
Q2. Which of the following distance vector features prevents routing loops by advertising an infinite metric route when a route fails?
a. Dijkstra SPF
c. Split horizon
d. Route poisoning
Q3. Which of the following is true about both RIPv1 and RIPv2? (Choose two answers.)
a. Uses a hop-count metric
b. Sends update messages to multicast address 22.214.171.124
c. Supports authentication
d. Uses split horizon
Q4. Router R1 uses RIPv1 and learns one possible route to reach subnet 10.1.1.0/24. That route would have a metric of 15 from R1’s perspective. Which of the following is true?
a. R1 cannot use the route, because metric 15 is considered to be infinity.
b. R1 will add the route to its routing table.
c. The cumulative bandwidth between R1 and subnet 10.1.1.0/24 is 15 Mbps.
d. The slowest bandwidth of the links between R1 and subnet 10.1.1.0/24 is 15 Kbps.
Q5. Routers A and B use EIGRP. How does router A watch for the status of router B so that router A can react if router B fails?
a. By using EIGRP hello messages, with A needing to receive periodic hello messages to believe B is still working.
b. By using EIGRP update messages, with A needing to receive periodic update messages to believe B is still working.
c. Using a periodic ping of B’s IP address based on the EIGRP neighbor timer.
d. None of the other answers is correct.
Q6. Which of the following affect the calculation of EIGRP metrics when all possible default values are used? (Choose two answers.)
e. Hop count
Q7. Which of the following routing protocols is considered to use link-state logic?
Q8. Which of the following is true about how a router using a link-state routing protocol chooses the best route to reach a subnet?
a. The router finds the best route in the link-state database.
b. The router calculates the best route by running the SPF algorithm against the information in the link-state database.
c. The router compares the metrics listed for that subnet in the updates received from each neighbor and picks the best (lowest) metric route.
d. The router uses the path that has the lowest hop count.