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 where a new router joins an existing OSPF area.
⚠ Common exam trap
Do not confuse the order of ExStart and Exchange, or Loading and Full. Remember that DR/BDR election occurs after 2-Way and before ExStart.
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 -> ExStart -> Exchange -> Loading -> Full
The new router first discovers neighbors via Hello. Then DD, LSR, LSU exchange synchronizes databases. DR/BDR election happens before Full state is achieved.
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 -> ExStart -> Exchange -> Loading -> Full
Why this is correct
This sequence correctly maps the OSPF neighbor state progression on a multi-access network. After the 2-Way state confirms bidirectional reachability, a DR/BDR election occurs (implicitly, before ExStart) to establish the hub for database synchronization. ExStart then negotiates the master/slave relationship and initial DD sequence numbers, leading through Exchange (sending/receiving DBDs) and Loading (sending LSRs and receiving LSUs), and finally reaching Full, where the topological databases are fully synchronized and the adjacency is operational.
- ✗
Down -> Init -> 2-Way -> ExStart -> Exchange -> Full -> Loading
Why it's wrong here
This order is invalid because it places Full before Loading, which contradicts the very purpose of the Loading state. Loading is the phase where a router sends Link-State Request packets for LSAs it has learned about from Database Description packets but does not yet have complete information for, and receives Link-State Update packets containing the full LSAs. Full is only achieved after every LSA has been received and the link-state databases are confirmed identical; thus, Full cannot occur before the Loading process completes.
- ✗
Down -> Init -> ExStart -> 2-Way -> Exchange -> Loading -> Full
Why it's wrong here
Skipping to ExStart before 2-Way is a fundamental error. The 2-Way state is the first point in the OSPF state machine that verifies that both routers have received each other's Hello packets with the correct Router ID and interface parameters, which proves bidirectional communication. Without reaching 2-Way, there is no confirmed physical or logical reachability, and DR/BDR election (which occurs after 2-Way on multi-access networks) cannot take place, so entering ExStart to start database exchange is completely premature and protocol-invalid.
- ✗
Down -> Init -> 2-Way -> Exchange -> ExStart -> Loading -> Full
Why it's wrong here
This sequence disrupts the mandatory handshake in OSPF database exchange. The ExStart state must absolutely precede the Exchange state because ExStart is where the two routers negotiate which one will be the master and which will be the slave, and they agree on the initial Database Description (DD) sequence number for reliable packet exchange. Jumping straight into Exchange without that negotiation means the routers would not have synchronized DD sequence numbers, making the ambiguous ordering of DBD packets impossible to resolve — therefore, no proper adjacency could ever form.
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 -> ExStart -> Exchange -> Loading -> FullCorrect answer▾
Why this is correct
This sequence correctly maps the OSPF neighbor state progression on a multi-access network. After the 2-Way state confirms bidirectional reachability, a DR/BDR election occurs (implicitly, before ExStart) to establish the hub for database synchronization. ExStart then negotiates the master/slave relationship and initial DD sequence numbers, leading through Exchange (sending/receiving DBDs) and Loading (sending LSRs and receiving LSUs), and finally reaching Full, where the topological databases are fully synchronized and the adjacency is operational.
✗Down -> Init -> 2-Way -> ExStart -> Exchange -> Full -> LoadingWrong answer — click to see why▾
Why this is wrong here
The Loading state is where LSRs and LSUs are exchanged to synchronize LSDBs; Full cannot be reached before Loading finishes.
Why candidates choose this
Candidates might confuse the order of Loading and Full, thinking Full is reached earlier.
✗Down -> Init -> ExStart -> 2-Way -> Exchange -> Loading -> FullWrong answer — click to see why▾
Why this is wrong here
The 2-Way state confirms that both routers have seen each other's Hello packets; ExStart cannot occur until after 2-Way.
Why candidates choose this
Candidates might think that ExStart (negotiation) happens immediately after Init, skipping the 2-Way confirmation.
✗Down -> Init -> 2-Way -> Exchange -> ExStart -> Loading -> FullWrong answer — click to see why▾
Why this is wrong here
Exchange state relies on the parameters agreed upon during ExStart; reversing them violates the OSPF state machine.
Why candidates choose this
Candidates might mistakenly think that database exchange (Exchange) starts immediately after 2-Way, forgetting the negotiation step.
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
OSPFv3 Single-Area Configuration for IPv6
Key term
Router
A router is a networking device that connects different networks together and directs data traffic between them by choosing the best path for data to travel.
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.