mediumMultiple SelectObjective-mapped
350-401 Practice Question: Which two statements about EIGRP feasible…
Which two statements about EIGRP feasible successors are true? (Choose two.)
Answer choices
Why each option matters
Answer the question above first, then reveal the full breakdown to understand why each option is right or wrong.
Correct answer & explanation
✓
A feasible successor must have a reported distance less than the feasible distance of the current successor.
A feasible successor is a backup route that meets the feasibility condition (reported distance < feasible distance). It is stored in the topology table, not the routing table, and is used immediately if the successor fails.
Answer analysis
Option-by-option breakdown
For each option: why learners choose it and why it is or isn't the right answer here.
- ✓
A feasible successor must have a reported distance less than the feasible distance of the current successor.
Why this is correct
Correct because the feasibility condition requires RD < FD for a route to be considered a feasible successor.
- ✗
A feasible successor is installed in the routing table as a backup route.
Why it's wrong here
Incorrect because feasible successors are kept in the topology table, not the routing table; only the successor is in the routing table.
- ✓
If a successor fails, EIGPR immediately uses a feasible successor without transitioning to active state.
Why this is correct
Correct because EIGRP can immediately use a feasible successor, avoiding a query process (active state).
- ✗
The feasible successor must have the same metric as the successor.
Why it's wrong here
Incorrect because the feasible successor can have a higher metric as long as it meets the feasibility condition.
- ✗
EIGRP uses the Diffusing Update Algorithm (DUAL) to determine feasible successors.
Why it's wrong here
Incorrect because DUAL is the overall algorithm used by EIGRP, but feasible successors are determined by the feasibility condition, not DUAL alone.
Quick reference
Routing Protocol Comparison
| 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
Related to this question
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 →
JA
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.