OSPF is a ____________ algorithm and is based on ________________________ for its algorithm.

OSPF is a ____________ algorithm and is based on ________________________ for its algorithm.

• A. Link State, Dijkstra's Shortest Path First
• B. Distance Vector, Hop Count
• C. Link State, Bellman-Ford
• D. Hybrid, Bellman-Ford

Answer: (A)

OSPF is a link-state routing protocol that builds a complete map of the network by exchanging link-state advertisements. With that topology, every router runs Dijkstra's algorithm, also called Shortest Path First, to compute the shortest-path tree and determine the best next hop for each destination. This combination—sharing full topology information and applying SPF to pick optimal routes—gives fast convergence and scalable performance. The other approaches describe distance-vector methodologies (which rely on hop count and Bellman-Ford updates) or hybrid schemes, which do not apply to OSPF.

OSPF is a link-state routing protocol that builds a complete map of the network by exchanging link-state advertisements. With that topology, every router runs Dijkstra's algorithm, also called Shortest Path First, to compute the shortest-path tree and determine the best next hop for each destination. This combination—sharing full topology information and applying SPF to pick optimal routes—gives fast convergence and scalable performance. The other approaches describe distance-vector methodologies (which rely on hop count and Bellman-Ford updates) or hybrid schemes, which do not apply to OSPF.