hardMultiple ChoiceObjective-mapped
300-410 Practice Question: Which statement correctly describes the behavior…
Which statement correctly describes the behavior of OSPF network type 'point-to-multipoint' regarding neighbor discovery?
⚠ Common exam trap
Cisco often tests the misconception that point-to-multipoint uses multicast hellos (like broadcast or point-to-point) or that it still requires a DR/BDR (like NBMA), leading candidates to confuse it with other OSPF network types.
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
✓
Neighbors are discovered via unicast hello packets and no DR/BDR is elected.
In OSPF point-to-multipoint network type, neighbors are manually configured or discovered via unicast hello packets because the network does not support broadcast or multicast flooding. No Designated Router (DR) or Backup Designated Router (BDR) is elected because the network is treated as a collection of point-to-point links, avoiding the need for a central adjacency point.
Answer analysis
Option-by-option breakdown
For each option: why learners choose it and why it is or isn't the right answer here.
- ✗
Neighbors are discovered via multicast hello packets and a DR/BDR is elected.
Why it's wrong here
Multicast hello and DR/BDR election are characteristic of broadcast networks, not point-to-multipoint.
- ✓
Neighbors are discovered via unicast hello packets and no DR/BDR is elected.
Why this is correct
Correct. Point-to-multipoint uses unicast hellos and no DR/BDR election.
- ✗
Neighbors are discovered via multicast hello packets but no DR/BDR is elected.
Why it's wrong here
Multicast hellos are not used on point-to-multipoint networks; hellos are unicast.
- ✗
Neighbors are discovered via unicast hello packets and a DR/BDR is elected.
Why it's wrong here
DR/BDR election does not occur on point-to-multipoint networks.
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.