Question 227 of 1,819
IP RoutingmediumDrag & DropObjective-mapped

OSPF Neighbor States — Correct Order on Multi-Access Networks

This 200-301 practice question tests your understanding of ip routing. The scenario asks you to isolate a root cause — eliminate options that address a different problem before choosing. After answering, compare your reasoning against the explanation and wrong-answer breakdown below. Once you have made your selection, read the full explanation to reinforce the concept and understand why each distractor is designed to mislead on exam day.

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.

Quick Answer

The correct OSPF neighbor state order on a multi-access network is Down, Init, 2-Way, ExStart, Exchange, Loading, Full. This sequence is specific to multi-access networks because the 2-Way state triggers the DR/BDR election, which must complete before the master/slave negotiation in ExStart begins; without this election, routers cannot efficiently synchronize databases in a broadcast environment. On the CCNA 200-301 v2 exam, this drag-and-drop task tests your understanding of the full adjacency process, and a common trap is omitting the Loading state or placing it before Exchange—remember that routers first exchange Database Description packets (Exchange) before sending Link State Requests (Loading). A helpful mnemonic is “DID ELF” (Down, Init, 2-Way, ExStart, Exchange, Loading, Full) to lock in the correct progression.

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.

Key principle: OSPF neighbour adjacency depends on matching area, hello/dead timers, network type, and authentication — IP reachability alone is not enough.

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 states, including the mandatory Loading state where LSAs are requested and updated before reaching Full adjacency.

    Related concept

    OSPF neighbours must agree on key parameters.

  • Down, Init, ExStart, Exchange, Loading, 2-Way (DR/BDR election), Full

    Why it's wrong here

    This order incorrectly places DR/BDR election after Exchange. In reality, election occurs during the 2-Way state, before database exchange begins.

  • Down, Init, 2-Way (DR/BDR election), Loading, Exchange, ExStart, Full

    Why it's wrong here

    This order incorrectly places ExStart before 2-Way. The 2-Way state is reached after Init, and DR/BDR election occurs during 2-Way, before ExStart.

  • Down, Init, 2-Way (DR/BDR election), ExStart, Exchange, Full

    Why it's wrong here

    This order incorrectly places Exchange before ExStart. ExStart is the state where master/slave and initial DD sequence numbers are negotiated, which must occur before the Exchange state.

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 states, including the mandatory Loading state where LSAs are requested and updated before reaching Full adjacency.

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?”

Common exam traps

Common exam trap: OSPF can fail even when IP connectivity looks correct

OSPF neighbour formation depends on matching areas, timers, network type, authentication and passive-interface behaviour. Do not choose an answer only because the devices can ping.

Detailed technical explanation

How to think about this question

OSPF questions usually test the details that control adjacency and route selection. Read the neighbour state, area, router ID and interface configuration before deciding what is wrong.

KKey Concepts to Remember

  • OSPF neighbours must agree on key parameters.
  • Router ID selection can affect neighbour relationships and LSDB output.
  • OSPF cost influences the preferred path.
  • A route can appear in OSPF information but not become the installed route.

TExam Day Tips

  • Check area mismatch first when OSPF adjacency fails.
  • Review passive interfaces when a network is advertised but no neighbour forms.
  • Use show ip ospf neighbor and show ip route clues carefully.

Key takeaway

OSPF neighbour adjacency depends on matching area, hello/dead timers, network type, and authentication — IP reachability alone is not enough.

Real-world example

How this comes up in practice

A network engineer at a university connects two campus buildings via a fibre link. Both routers run OSPF, but no adjacency forms — even though both routers can ping each other. The engineer finds one router is in area 0 and the other in area 1. OSPF adjacency requires matching area numbers, hello/dead timers, and network type. IP reachability alone is not enough.

Visual reference

R1 R2 R3 R4 10 100 10 100 OSPF picks R1→R2→R4 (cost 20) over R1→R3→R4 (cost 200)

Quick reference

Routing Protocol Comparison

ProtocolMetricMax HopsAlgorithmType
RIP v2Hop count15Bellman-FordDistance vector
OSPFCost (bandwidth)UnlimitedDijkstra (SPF)Link state
EIGRPComposite metricUnlimitedDUALHybrid
IS-ISCostUnlimitedDijkstraLink state
BGPPolicy / attributesUnlimitedPath vectorPath vector

RIP's 15-hop limit makes it unsuitable for large networks. OSPF and EIGRP dominate modern enterprise deployments.

What to study next

Got this wrong? Here's your next step.

Review OSPF neighbour requirements — matching area type, hello and dead timers, network type, stub flags, and authentication. Study show ip ospf neighbor states (INIT, 2-WAY, FULL). Then practise related 200-301 OSPF questions on adjacency and route selection.

Related practice questions

Related 200-301 practice-question pages

Use these pages to review the topic behind this question. This is how one missed question becomes focused revision.

Practice this exam

Start a free 200-301 practice session

Short sessions build daily habit. Longer sessions build exam-day stamina. Try a timed session to simulate real conditions.

FAQ

Questions learners often ask

What does this 200-301 question test?

IP Routing — This question tests IP Routing — OSPF neighbours must agree on key parameters..

What is the correct answer to this question?

The correct answer is: 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.

What should I do if I get this 200-301 question wrong?

Review OSPF neighbour requirements — matching area type, hello and dead timers, network type, stub flags, and authentication. Study show ip ospf neighbor states (INIT, 2-WAY, FULL). Then practise related 200-301 OSPF questions on adjacency and route selection.

What is the key concept behind this question?

OSPF neighbours must agree on key parameters.

About these practice questions

Courseiva creates original exam-style practice questions with explanations and wrong-answer analysis. It does not publish real exam questions, exam dumps, or protected exam content. Learn why practice questions differ from exam dumps →

How Courseiva writes practice questions · Editorial policy

Keep practising

More 200-301 practice questions

Last reviewed: Jun 6, 2026

Question Discussion

Share a tip, memory trick, or ask about the reasoning behind this question. Do not post real exam questions, leaked content, braindumps, or copyrighted exam material. Comments are moderated and may be removed without notice.

Loading comments…

Sign in to join the discussion.

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.