Question 1mediummulti select
Review the full routing breakdown →Question 1,378 of 1,819
Quick Answer
The answer is that distance vector routing protocols converge more slowly than link-state protocols in large networks. This is because distance vector protocols operate on a “routing by rumor” principle, where each router knows only the direction and metric to a destination as reported by its directly connected neighbors, without a full map of the network topology. Periodic full routing table updates—common in classic protocols like RIP—further slow convergence, though advanced distance vectors like EIGRP use triggered partial updates after an initial full exchange. On the CCNA 200-301 v2 exam, this characteristic tests your understanding of how distance vector protocols scale and behave compared to link-state alternatives; a common trap is assuming all distance vector protocols send full tables at fixed intervals, which is not true for EIGRP. Remember the memory tip: “Distance vector sees the sign, not the whole map—so convergence takes a longer lap.”
CCNA IP Routing Practice Question
This 200-301 practice question tests your understanding of ip routing. Read the scenario carefully and evaluate each option against the stated constraints before committing to an answer. 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.
Which three of the following are characteristics of a distance-vector routing protocol? (Choose three.)
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
✓
Routers send their entire routing table to directly connected neighbors at regular intervals.
Distance-vector routing protocols are characterized by periodic full routing table updates to directly connected neighbors, as seen in classic protocols like RIP. However, advanced distance-vector protocols such as EIGRP do not send their full routing table at regular intervals; they perform a one-time full exchange during neighbor formation and then send only partial, triggered updates. Regardless of this distinction, all distance-vector protocols have a limited view of the network topology (often called 'routing by rumor'), rely on hop count or composite metrics, and converge more slowly than link-state protocols in large networks. The correct options highlight these general characteristics of distance-vector protocols.
Key principle: Answer the scenario, not the keyword: identify the specific constraint before choosing the most familiar-sounding option.
Common exam traps
Common exam trap: answer the scenario, not the keyword
A common mistake is to assume that all distance-vector protocols, including EIGRP, send their full routing table periodically; in reality, EIGRP only does a full exchange once and then uses partial updates.
Detailed technical explanation
How to think about this question
Distance-vector protocols use the Bellman-Ford algorithm to compute paths, where each router builds its routing table based on vectors (distances and directions) received from neighbors. A subtle behavior is the 'count-to-infinity' problem, which can cause routing loops; protocols like RIP mitigate this with a maximum hop count of 15. In real-world scenarios, OSPF (link-state) is preferred for large enterprise networks due to its fast convergence and loop-free SPF algorithm, while distance-vector protocols like RIP are often limited to small, simple networks.
KKey Concepts to Remember
- Read the scenario before looking for a memorised answer.
- Find the constraint that changes the correct option.
- Eliminate answers that are true in general but not in this case.
TExam Day Tips
- Watch for words such as best, first, most likely and least administrative effort.
- Review why wrong options are wrong, not only why the correct option is correct.
Key takeaway
Answer the scenario, not the keyword: identify the specific constraint before choosing the most familiar-sounding option.
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.
What to study next
Got this wrong? Here's your next step.
Identify which exam domain this question belongs to, review the core concept, then practise similar questions from the same domain.
- →
IP Routing — study guide chapter
Learn the concepts, then practise the questions
- →
IP Routing practice questions
Targeted practice on this topic area only
- →
All 200-301 questions
1,819 questions across all exam domains
- →
CCNA 200-301 v2 study guide
Full concept coverage aligned to exam objectives
- →
200-301 practice test guide
How to use practice tests most effectively before exam day
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.
Network Infrastructure and Connectivity practice questions
Practise 200-301 questions linked to Network Infrastructure and Connectivity.
Switching and Network Access practice questions
Practise 200-301 questions linked to Switching and Network Access.
IP Routing practice questions
Practise 200-301 questions linked to IP Routing.
Network Services and Security practice questions
Practise 200-301 questions linked to Network Services and Security.
AI and Network Operations practice questions
Practise 200-301 questions linked to AI and Network Operations.
CCNA subnetting practice questions
Practise IPv4 subnetting, CIDR, masks, host ranges and subnet selection.
CCNA OSPF practice questions
Practise OSPF neighbours, router IDs, metrics, areas and routing-table interpretation.
CCNA VLAN practice questions
Practise VLANs, access ports, trunks, allowed VLANs and switching scenarios.
CCNA STP practice questions
Practise spanning tree, root bridge election, port roles and STP troubleshooting.
CCNA EtherChannel practice questions
Practise LACP, PAgP, port-channel behaviour and bundle requirements.
CCNA ACL practice questions
Practise standard and extended ACLs, permit/deny logic and traffic filtering.
CCNA NAT practice questions
Practise static NAT, dynamic NAT, PAT and inside/outside address translation.
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 — Read the scenario before looking for a memorised answer..
What is the correct answer to this question?
The correct answer is: Routers send their entire routing table to directly connected neighbors at regular intervals. — Distance-vector routing protocols are characterized by periodic full routing table updates to directly connected neighbors, as seen in classic protocols like RIP. However, advanced distance-vector protocols such as EIGRP do not send their full routing table at regular intervals; they perform a one-time full exchange during neighbor formation and then send only partial, triggered updates. Regardless of this distinction, all distance-vector protocols have a limited view of the network topology (often called 'routing by rumor'), rely on hop count or composite metrics, and converge more slowly than link-state protocols in large networks. The correct options highlight these general characteristics of distance-vector protocols.
What should I do if I get this 200-301 question wrong?
Identify which exam domain this question belongs to, review the core concept, then practise similar questions from the same domain.
What is the key concept behind this question?
Read the scenario before looking for a memorised answer.
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 →
Last reviewed: Jun 11, 2026
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.
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.
Sign in to join the discussion.