M

Mr. Dubey • 53.58K Points
Coach 

Q. In Unicast Routing, Dijkstra algorithm creates a shortest path tree from a ________

(A) graph
(B) tree
(C) network
(D) link
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. Which of the following is correct regarding isolation factor?

Q. Which of the following is not a diagram studied in Requirement Analysis ?

Q. The network layer is concerned with __________ of data.

Q. ARP works on Ethernet networks.

Q. What is output of below program? int main() { int i,j,k,count; count=0; for(i=0;i<5;i++) { for(j=0;j<5;j++) { count++; } } printf("%d"

Q. Stress management is about learning

Q. ISO – 14001 gives stress on ___________

Q. How many types of protocols are important for instant messaging?

Q. DSL stands for

Q. Which of the following data structure is not linear data structure?

Question analytics