| 1: || |
If a router does not have a feasible successor, what action will it take?
| 2: || |
When does EIGRP need to be manually redistributed into another EIGRP process?
| 3: || |
Which timers are tracked in the neighbor table?
| 4: || |
What is the difference between an update and a query?
| 5: || |
When does EIGRP recalculate the topology table?
| 6: || |
EIGRP has a default limit set on the amount of bandwidth that it can use for EIGRP packets. What is the default percentage limit?
| 7: || |
State two rules for designing a scalable EIGRP network.
| 8: || |
EIGRP can be used to send information about which three routed protocols?
| 9: || |
Which EIGRP packets are sent reliably?
| 10: || |
In what instances will EIGRP automatically redistribute?
| 11: || |
How long is the holdtime, by default?
| 12: || |
What is an EIGRP topology table, and what does it contain?
| 13: || |
What is the advertised distance in EIGRP, and how is it distinguished from the feasible distance?
| 14: || |
What EIGRP algorithm is run to create entries for the routing table?
| 15: || |
When does EIGRP place a network in active mode?
| 16: || |
By default, EIGRP summarizes at which boundary?
| 17: || |
What is Stuck in Active?
| 18: || |
State two factors that influence EIGRP scalability.
| 19: || |
What are reply packets in EIGRP?
| 20: || |
What conditions must be met for a router to become a neighbor?