mediumMultiple ChoiceObjective-mapped
300-410 Practice Question: Runs the following command to troubleshoot OSPF…
A network engineer runs the following command to troubleshoot OSPF neighbor states:
R1# show ip ospf neighbor detail Neighbor 2.2.2.2, interface address 10.1.1.2
In the area 0 via interface GigabitEthernet0/0
Neighbor priority is 1, State is FULL, 6 state changes
DR is 10.1.1.2, BDR is 10.1.1.1 Options is 0x42 (LLS, DC) LLS Options is 0x1 (LR) Dead timer due in 00:00:36
Neighbor is up for 00:12:34
Index 1/1/1 Retransmission queue length 0, number of retransmission 1 First 0x0(0)/0x0(0)/0x0(0) Next 0x0(0)/0x0(0)/0x0(0) Last retransmission scan length is 1, maximum is 1 Last retransmission scan time is 0 msec, maximum is 0 msec
What does this output indicate?
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 neighbor is the DR and the adjacency is fully established.
The output shows detailed OSPF neighbor information, including state, DR/BDR roles, and timers.
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 neighbor is in the 2WAY state and not fully adjacent.
Why it's wrong here
The state is FULL, indicating a complete adjacency.
- ✓
The neighbor is the DR and the adjacency is fully established.
Why this is correct
The DR is 10.1.1.2 (neighbor's address) and state is FULL.
- ✗
There is a retransmission queue issue causing packet loss.
Why it's wrong here
The retransmission queue length is 0, indicating no pending retransmissions.
- ✗
The neighbor is not participating in DR/BDR election.
Why it's wrong here
Neighbor priority is 1, so it participates; it is the DR.
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
About these practice questions
One of 1,966 original 300-410 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 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.