The computation of the shortest path in OSPF is usually done by ______ – McqOptions

MCQOPTIONS

1.	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
Answer» D. Distance vector routing

Discussion

No Comment Found

Related MCQs

In OSPF database descriptor packet, if there are more database descriptor packets in the flow, ‘M’ field is set to ____________
What is the correct order of the operations of OSPF?i – Hello packetsii – Propagation of link-state information and building of routing tablesiii – Establishing adjacencies and synchronization of database
IN_OSPF_DATABASE_DESCRIPTOR_PACKET,_WHICH_FIELD_IS_USED_TO_DETECT_A_MISSING_PACKET??$
In OSPF database descriptor packet, which field is used to indicate that the router is master?
In OSPF database descriptor packet, if more database descriptor packet flows, ‚Äö√Ñ√∂‚àö√ë‚àö‚â§M‚Äö√Ñ√∂‚àö√ë‚àö¬• field is set to ___________?#
Which of the following is false with respect to the features of OSPF?
The computation of the shortest path in OSPF is usually done by ____________
Open Shortest Path First (OSPF) is also called as _____________