CompTIA Network+ N10-009 Practice Question
OSPF uses the Bellman-Ford algorithm for the shortest path calculation.
True
False
CompTIA Network+ N10-009
Network Implementation
Your Score:
SAVE $45
Bash, the Crucial Exams Chat Bot
AI Bot
OSPF uses the Bellman-Ford algorithm for the shortest path calculation.
True
False
The correct answer is 'False'. OSPF actually utilizes the Dijkstra's algorithm to compute the shortest path tree for each route. The Bellman-Ford algorithm, conversely, is used by protocols like RIP, which is different from OSPF.
Bash is our AI bot, trained to help you pass your exam. AI Generated Content may display inaccurate information, always double-check anything important.
Join premium for unlimited access and more features
All plans include the following perks.
Our pricing is simple. Full access to all certifications and exams, for one price.
As many practice tests for as many topics as you want.
Use study mode non-stop, no limits.
No annoying ads and popups. Study without distractions.
Track your scores over time in study mode and report cards.
See how you improve over time, and where you need to focus.
Access our store with even more discounts than before.
Unlimited access to all PBQs and be prepared for the real thing.
Create an account or sign in to access our study materials.