M

Mr. Dubey • 52.70K 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
Share

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.

Related MCQs

Q. is data-link layer vulnerability where stations are forced to make direct communication with another station by evading logic

Q. What is the correct Run-length encoding for the data: cccmmmmmsssssdcccccc

Q. Regarding Augment/NLS:

Q. From the following, which is not a common file permission?

Q. Church’s Thesis supports

Q. structured design was developed by ----- and --------------------.

Q. In a positive edge triggered JK flip flop, a low J and low K produces?

Q. The file transfer protocol is built on

Q. What does the C30software architecture describe?

Q. The parameters of a method __________.

Question analytics