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

A firewall needs to be so that it can grow proportionally with the network that it protects.
Which of the following is a transport layer protocol?
supports low energy radio operation.
A typical program obtains a remote reference to one or more remote objects on a server and then invokes methods on them.
The packet sent by a node to the source to inform it of congestion is called
may be forced for flooding traffic to all VLAN ports allowing interception of data through any device that is connected to a VLAN.
Application layer offers service.
As a system administrator, you want to debug IGRP but are worried that the “debug IP IGRP transaction” command will flood the console. What is the command that you should use?
enables open application layer for constrained nodes.
is the multiplexing technique that shifts each signal to a different carrier frequency.