Q&A
The questions and scenarios in this book are designed to be challenging and to make sure that you know the answer. Rather than allowing you to derive the answers from clues hidden inside the questions themselves, the questions challenge your understanding and recall of the subject.
You can find the answers to these questions in Appendix A. For more practice with exam-like question formats, use the exam engine on the CD-ROM.
| 1. | If a router does not have a feasible successor, what action will it take? |
| 2. | Which timers are tracked in the neighbor table? |
| 3. | What is the difference between an update and a query? |
| 4. | When does EIGRP recalculate the topology table? |
| 5. | State two rules for designing a scalable EIGRP network. |
| 6. | Which EIGRP packets are sent reliably? |
| 7. | How long is the holdtime by default? |
| 8. | What is an EIGRP topology table, and what does it contain? |
| 9. | What is the advertised distance in EIGRP, and how is it distinguished from the feasible distance? |
| 10. | What EIGRP algorithm is run to create entries for the routing table? |
| 11. | When does EIGRP place a network in active mode? |
| 12. | By default, EIGRP summarizes at which boundary? |
| 13. | What is Stuck in Active? |
| 14. | State two factors that influence EIGRP scalability. |
| 15. | What are reply packets in EIGRP? |
| 16. | What conditions must be met for a router to become a neighbor? |
