A

Admin • 802.91K Points
Coach

Q. 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

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.