4A0-100 Question #271: Real Exam Question with Answer & Explanation

The correct answer is D. It uses hop-count for route selection.. OSPF (Open Shortest Path First) is a Link-State protocol that uses: Cost (based on bandwidth) as its metric. Dijkstra's algorithm to compute shortest path trees. Supports hierarchical routing with areas (e.g., Area 0 as backbone). Routers exchange LSAs, not full routing tables. O

Question

Which of the following statements about OSPF routing protocol is FALSE?

Options

AIt is a link state protocol.
BIt supports hierarchy using multiple areas.
CIt supports VLSM and address aggregation.
DIt uses hop-count for route selection.

Explanation

OSPF (Open Shortest Path First) is a Link-State protocol that uses: Cost (based on bandwidth) as its metric. Dijkstra's algorithm to compute shortest path trees. Supports hierarchical routing with areas (e.g., Area 0 as backbone). Routers exchange LSAs, not full routing tables. Option D is FALSE - OSPF does not use hop-count. That's a RIP (Distance Vector) feature.

Community Discussion

No community discussion yet for this question.

Full 4A0-100 Practice