Register

djikstra algo

439 views

1 Answer

Best answer
4 4 votes

Answer : Calculate the routing table

Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a graph, like this .And it is very useful when it comes to create a Routing Table to find the shortest path between Routes on the way.

• selected by
Voting & Accepting an answer helps improve the community
← Previous · optimum page sizeNext → · UGC NET CSE | Septem...
← Previous in category · mobile commnNext in category → · ISRO
Position:
Show:

Related questions

1 1 vote
0 0 answers
1.4k
1.4k views
srestha asked May 14, 2019
1,409 views
Made Easy Test Series: Computer Network-Dijkstra Algo
Consider Dijkstra’s algorithm in linked state routing protocol at node $u.$ Professor Ram first sets the route for each directly connected node $v.$ to be the link connec...
0 0 votes
0 0 answers
346
346 views
Lokesh Arya asked Jul 4, 2018
346 views
Routings algo
what is the diffrence between protocols and Algorithms or both are same or not???
0 0 votes
2 answers 2 answers
1.9k
1.9k views
radha gogia asked Apr 10, 2018
1,881 views
What would be the message sent by the sender in RSA Algo ?
RSA public key cryptography used with public key pair (e,n) is given as (5 ,35) and the primitive key pair (d,n) as (29,35) .If receiver receives message as 22 , what wou...
2 2 votes
0 0 answers
2.0k
2.0k views
A_i_$_h asked Sep 22, 2017
1,973 views
back off algo
Assume X and Y are the only two stations on ethernet.Each has a steady queue of frames to send.Both X and Y attempt to tranmit a frame,they wait to get the control of the...