Courseiva
hardMultiple Choice

300-410 Practice Question: A network engineer runs the following command to troubleshoot a VRF-Lite OSPF adjacency…

A network engineer runs the following command to troubleshoot a VRF-Lite OSPF adjacency issue:

R1# debug ip ospf adj vrf CUSTOMER_C

Output: OSPF: 2 Way state received from 10.1.1.2 on interface GigabitEthernet0/1, address 10.1.1.2 OSPF: Neighbor 10.1.1.2 is eligible for DR election on interface GigabitEthernet0/1 OSPF: DR election: 10.1.1.1 (pri 1) is DR, 10.1.1.2 (pri 1) is BDR OSPF: Build router LSA for area 0, router ID 1.1.1.1, seq 0x80000001 OSPF: Neighbor 10.1.1.2 is FULL, state changed from LOADING to FULL

What does this output indicate?

⚠ Common exam trap

The trap is that candidates see '2 Way state received' and assume the adjacency is stuck in 2-Way, but the later line showing FULL indicates success; the 2-Way message is just part of the normal election sequence.

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

✓

The OSPF adjacency formed successfully, with 10.1.1.1 as DR and 10.1.1.2 as BDR.

The debug output shows the neighbor state changing from LOADING to FULL, which means the OSPF adjacency successfully completed database exchange and reached the FULL state. It also shows that 10.1.1.1 was elected DR and 10.1.1.2 was elected BDR, confirming a stable adjacency on the segment. The earlier 2-Way state is a normal part of the DR/BDR election process before the adjacency progresses to FULL.

Answer analysis

Option-by-option breakdown

For each option: why learners choose it and why it is or isn't the right answer here.

  • ✗

    The OSPF adjacency failed because the neighbor remained in LOADING state.

    Why it's wrong here

    Loading is the stage where a router requests the LSAs it is missing after the database description exchange. The final debug line shows the neighbour moving from Loading to Full, so the databases synchronised and the adjacency succeeded. A neighbour genuinely stuck in Loading would never show that transition, and often points to corrupted or missing LSAs, or an MTU problem during the exchange.

  • ✓

    The OSPF adjacency formed successfully, with 10.1.1.1 as DR and 10.1.1.2 as BDR.

    Why this is correct

    The debug follows a normal progression inside VRF CUSTOMER_C: the neighbour reaches 2-Way, the DR election runs with both routers at priority 1 so router ID decides, 10.1.1.1 becomes DR and 10.1.1.2 BDR, a router LSA is built, and the neighbour goes from Loading to Full. Full means link-state databases match and routes can be calculated, so the adjacency is healthy.

  • ✗

    The OSPF adjacency formed but the router ID is missing, causing instability.

    Why it's wrong here

    The log shows the neighbour reached FULL, so the adjacency succeeded; no router ID is missing, since 1.1.1.1 and 1.1.1.2 are both present. It tempts because 2-Way and DR election lines appear, which do signal a stuck adjacency when neighbours never progress beyond 2-Way — the genuine fault this output rules out.

  • ✗

    The OSPF adjacency is stuck in 2-Way state due to mismatched area IDs.

    Why it's wrong here

    Routers with mismatched area IDs never reach 2-Way, because each discards the other's hellos and the router logs a mismatched area message. Here 2-Way is reached and then progresses all the way to Full. On broadcast networks, routers that are neither DR nor BDR do stay in 2-Way with each other by design, but that is normal behaviour, not a fault.

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.

About these practice questions

Courseiva writes every 300-410 question from scratch — 1,401 in total, each with an explanation and a wrong-answer breakdown. None are copied from real exams or dumps. Learn why practice questions differ from exam dumps →

How Courseiva writes practice questions · Editorial policy

You might also like

Similar 300-410 questions

Written and reviewed by Johnson Ajibi, MSc IT Security

Security Systems Architect · founder of Courseiva

Last reviewed September 2026 · checked against the official Cisco exam blueprint

This 300-410 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 300-410 exam.