mediumMultiple ChoiceObjective-mapped
300-410 Practice Question: Runs the following command on Router R1: R1# show…
A network engineer runs the following command on Router R1:
R1# show ip ospf neighbor Neighbor ID Pri State Dead Time Address Interface 10.1.1.2 1 FULL/DROTHER 00:00:35 192.168.12.2 GigabitEthernet0/0 10.1.1.3 1 FULL/DR 00:00:32 192.168.13.3 GigabitEthernet0/1
Based on this output, which statement is correct?
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
✓
Router R1 has a full adjacency with both neighbors and is in a stable state.
The output shows two OSPF neighbors. The neighbor with state FULL/DROTHER indicates it is not the DR or BDR on that segment. The neighbor with state FULL/DR is the designated router. The dead times are within normal range, indicating the adjacency is stable.
Answer analysis
Option-by-option breakdown
For each option: why learners choose it and why it is or isn't the right answer here.
- ✗
Router R1 is the DR on the segment connected to GigabitEthernet0/0.
Why it's wrong here
The neighbor state is DROTHER, meaning R1 is not the DR; the neighbor is DROTHER, so R1 might be DR or BDR, but the output only shows neighbor states, not R1's own role.
- ✓
Router R1 has a full adjacency with both neighbors and is in a stable state.
Why this is correct
Both neighbors show FULL state, indicating complete adjacency. Dead times are decreasing normally, so adjacencies are stable.
- ✗
Router R1 is experiencing a neighbor timeout on GigabitEthernet0/1.
Why it's wrong here
Dead time is 00:00:32, which is not near zero, so no timeout is imminent.
- ✗
Router R1 is not receiving hello packets from 10.1.1.2.
Why it's wrong here
The neighbor state is FULL, so hello packets are being received; otherwise the state would be DOWN or INIT.
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
This 300-410 question is part of Courseiva's 1,966-question bank — original exam-style content with full explanations and wrong-answer analysis, never real exam questions or exam dumps. 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.