Juniper
JN0-281 · Question #25
JN0-281 Question #25: Real Exam Question with Answer & Explanation
Sign in or unlock JN0-281 to reveal the answer and full explanation for question #25. The question stem and answer options stay visible for context.
Question
How does OSPF calculate the best path to a particular prefix?
Options
- AIt finds the path with the numerically lowest cost.
- BIt finds the path with the shortest autonomous system path.
- CIt finds the path with the least number of hops.
- DIt finds the path with the numerically lowest route preference.
Unlock JN0-281 to see the answer
You've previewed enough free JN0-281 questions. Unlock JN0-281 for full answers, explanations, the timed quiz mode, progress tracking, and the master PDF. Question stem and options stay visible so you can still see what's on the exam.