M

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

Loading Comments....

Related MCQs

Q. Let the class of language accepted by finite state machine be L1 and the class of languages represented by regular expressions be L2 then

Q. Which is the software or a programming language used for controlling of Arduino?

Q. _________ is a type of memory circuitry that holds the computer’s start-up routine.

Q. When you have developed a theory, what can you do to confirm that your hypothesis is correct?

Q. In file handling, what does this terms means “r, a”?

Q. Environment variables can be accessed by

Q. For what purpose Feedback neural networks are primarily used?

Q. Which of the following is the same as list(map(lambda x: x**-1, [1, 2, 3]))?

Q. Process oriented Main element Issue, position and arguments Which design rationale suite the characteristic above?

Q. Which one of the following is not used in media access control?

Question analytics