Question

The computation of the shortest path in OSPF is usually done by ____________

(a) Bellman-ford algorithm

(b) Routing information protocol

(c) Dijkstra’s algorithm

(d) Distance vector routing

This question was addressed to me during an interview.

I'd like to ask this question from OSPF topic in section Network Layer of Computer Network

Answer 1

The correct choice is (c) Dijkstra’s algorithm

Easiest explanation: Shortest path in OSPF is usually computed by Dijkstra’s algorithm. It was proposed by Edsger W. Dijkstra in the year 1956. It is a greedy method algorithm and hence may not guarantee the shortest path every time, but is really fast.