Match each EIGRP term to its definition.
Drag a concept onto its matching description — or click a concept then click the description.
Best metric to a destination
Metric advertised by neighbor
Backup route without loops
Primary route with lowest metric
Ensures loop-free backup routes
Answer choices
Answer the question above first, then reveal the full breakdown to understand why each option is right or wrong.
Correct answer & explanation
Feasible Distance: The total metric from the local router to the destination network.
EIGRP uses Feasible Distance (FD) as the best metric to a destination, Reported Distance (RD) as a neighbor's metric, and the Feasible Condition (RD < FD) to ensure loop-free paths. Successor is the next-hop router with the lowest FD.
Answer analysis
For each option: why learners choose it and why it is or isn't the right answer here.
Feasible Distance: The total metric from the local router to the destination network.
Why this is correct
Feasible Distance is the best metric (lowest total cost) to reach a destination from the local router.
Reported Distance: The metric advertised by a neighboring router for a specific route.
Why this is correct
Reported Distance is the metric that a neighbor advertises for a route; it represents the neighbor's cost to reach the destination.
Feasible Condition: The condition where the reported distance is less than the feasible distance.
Why this is correct
The Feasible Condition (RD < FD) ensures loop-free paths by only allowing routes from neighbors with a lower reported distance.
Successor: The next-hop router that has the lowest feasible distance to a destination.
Why this is correct
A successor is the primary next-hop router; it has the lowest Feasible Distance to the destination.
Feasible Distance: The metric advertised by a neighboring router for a specific route.
Why it's wrong here
Incorrect — this definition describes Reported Distance, not Feasible Distance.
Reported Distance: The total metric from the local router to the destination network.
Why it's wrong here
Incorrect — this definition describes Feasible Distance, not Reported Distance.
Quick reference
| Protocol | Metric | Max Hops | Algorithm | Type |
|---|---|---|---|---|
| RIP v2 | Hop count | 15 | Bellman-Ford | Distance vector |
| OSPF | Cost (bandwidth) | Unlimited | Dijkstra (SPF) | Link state |
| EIGRP | Composite metric | Unlimited | DUAL | Hybrid |
| IS-IS | Cost | Unlimited | Dijkstra | Link state |
| BGP | Policy / attributes | Unlimited | Path vector | Path vector |
RIP's 15-hop limit makes it unsuitable for large networks. OSPF and EIGRP dominate modern enterprise deployments.
Go deeper
About these practice questions
This 350-401 question is part of Courseiva's 1,175-question bank — original exam-style content with full explanations and wrong-answer analysis, never real exam questions or exam dumps. Learn why practice questions differ from exam dumps →
Written by Johnson Ajibi, MSc IT Security
Senior Network & Security Engineer · founder of Courseiva
This 350-401 practice question is part of Courseiva's free Cisco certification practice question bank. Courseiva provides original exam-style practice questions with explanations, topic-based practice, mock exams, readiness tracking, and study analytics to help learners prepare for the 350-401 exam.