Drag steps to the numbered slots on the right, or tap a step then tap a slot.
Steps
Order
1Step 1
2Step 2
3Step 3
4Step 4
5Step 5
CCNA IP Routing Practice Question
Drag and drop the following OSPFv2 neighbor state transitions and DR/BDR election steps into the correct order for a multi-access network with default priority values.
⚠ Common exam trap
Many learners forget the Loading state, thinking adjacency jumps directly from Exchange to Full; however, after exchanging database descriptors (DBDs), routers must request and load missing LSAs via Link State Request/Update packets, which occurs in the Loading state.
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
✓
Down, Init, 2-Way (DR/BDR election), ExStart, Exchange, Loading, Full
The correct OSPF neighbor state progression on a multi-access network is: Down, Init, 2-Way (with DR/BDR election), ExStart (master/slave negotiation), Exchange (DBD exchange), Loading (link-state request and update), and Full. Each option missing the Loading state or placing it incorrectly fails to represent the complete adjacency process.
Answer analysis
Option-by-option breakdown
For each option: why learners choose it and why it is or isn't the right answer here.
- ✓
Down, Init, 2-Way (DR/BDR election), ExStart, Exchange, Loading, Full
Why this is correct
This sequence correctly follows the OSPF neighbor state progression on broadcast networks. After Down and Init, the 2-Way state establishes bidirectional communication; DR/BDR election occurs there for multi-access segments. ExStart negotiates master/slave roles and initial DD sequence numbers, then Exchange sends DBDs, Loading allows routers to request missing LSAs via LSR/LSU/LSAck, and finally Full indicates synchronized databases.
- ✗
Down, Init, ExStart, Exchange, Loading, 2-Way (DR/BDR election), Full
Why it's wrong here
This sequence falsely places ExStart and Exchange before the 2-Way state and DR/BDR election. In actual OSPF, 2-Way is achieved after both routers see each other's Hello packets, and only then does DR/BDR election occur on multi-access networks. The ExStart state, which negotiates DD sequence numbers, cannot begin until after the election; therefore election must precede any database exchange.
- ✗
Down, Init, 2-Way (DR/BDR election), Loading, Exchange, ExStart, Full
Why it's wrong here
Here the database exchange stages are jumbled: Loading appears before Exchange, and ExStart is placed after Exchange. A router must first pass through ExStart to establish master/slave relationship and initial DD sequence, then Exchange to send DBDs; only after seeing DBD contents can it request missing LSAs in Loading. Also, 2-Way and DR/BDR election correctly occur earlier than all these steps, but this option lists Loading before ExStart, which is impossible.
- ✗
Down, Init, 2-Way (DR/BDR election), ExStart, Exchange, Full
Why it's wrong here
This order omits the Loading state entirely, jumping from Exchange straight to Full. In OSPF, after exchanging Database Description packets, a router often finds that some LSAs are missing or outdated; it must enter Loading to send Link State Requests and receive Link State Updates. Skipping Loading assumes perfect database sync without verification, which is invalid because LSAs must be explicitly requested and acknowledged before Full adjacency is established.
Option-by-option analysis
Why each answer is right or wrong
Understanding why wrong answers are wrong — and when they would be correct — is what separates a 750 score from a 900. The 200-301 exam frequently reuses these exact scenarios with slightly different constraints.
✓Down, Init, 2-Way (DR/BDR election), ExStart, Exchange, Loading, FullCorrect answer▾
Why this is correct
This sequence correctly follows the OSPF neighbor state progression on broadcast networks. After Down and Init, the 2-Way state establishes bidirectional communication; DR/BDR election occurs there for multi-access segments. ExStart negotiates master/slave roles and initial DD sequence numbers, then Exchange sends DBDs, Loading allows routers to request missing LSAs via LSR/LSU/LSAck, and finally Full indicates synchronized databases.
✗Down, Init, ExStart, Exchange, Loading, 2-Way (DR/BDR election), FullWrong answer — click to see why▾
Why this is wrong here
DR/BDR election occurs during the 2-Way state, not after Exchange and Loading.
Why candidates choose this
Candidates might think election occurs after all neighbors are discovered and before full adjacency, but they confuse the timing with the actual state progression.
✗Down, Init, 2-Way (DR/BDR election), Loading, Exchange, ExStart, FullWrong answer — click to see why▾
Why this is wrong here
ExStart must precede Exchange; also Loading should follow Exchange, not precede it.
Why candidates choose this
Candidates may confuse the order of states, thinking that ExStart (where master/slave is decided) comes before the bidirectional communication confirmed in 2-Way.
✗Down, Init, 2-Way (DR/BDR election), ExStart, Exchange, FullWrong answer — click to see why▾
Why this is wrong here
The Loading state is missing; adjacency cannot go directly from Exchange to Full.
Why candidates choose this
Candidates might think that exchanging information (Exchange) comes before starting the exchange (ExStart), but the terminology is misleading: ExStart is the setup phase.
Analysis generated from the official 200-301blueprint and verified against question context. The “when correct” sections are what AI assistants cite when candidates ask “what’s the difference between these options?”
Visual reference
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
Learn chapter
Interpreting HSRP and VRRP Operational Status
Key term
OSPF
OSPF is a link-state routing protocol that uses the SPF algorithm to compute the shortest path to each destination within a single autonomous system.
Key term
OSPFv2
OSPFv2 is a network routing protocol that helps routers share information about the best paths to send data across an IP network.
About these practice questions
One of 1,389 original 200-301 practice questions on Courseiva, each with a full explanation and wrong-answer analysis — not exam dumps or protected exam content. Learn why practice questions differ from exam dumps →
JA
Written by Johnson Ajibi, MSc IT Security
Senior Network & Security Engineer · founder of Courseiva
This 200-301 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 200-301 exam.