5,097 views
13 votes
13 votes

Djikstra’s algorithm is used to

  1. Create LSAs
  2. Flood an internet with information
  3. Calculate the routing tables
  4. Create a link state database

3 Answers

Best answer
14 votes
14 votes

answer is c)

Calculation of routing tables ,as djikstra algorithm calculates shortest path for all

the nodes  in link state routing protocol .

selected by
1 votes
1 votes

Djikstra’s algorithm is used to A)Create LSAs

In LSA (Linked State algorithm) we finds minimum path which is done by Djikstra’s algorithm

1 votes
1 votes
If we talk about Dijsktra algorithm, it is used to find Shortest path.

In computer it has been preferred in many applications.In routing when we go with link state Routing and we had to find shortest path between routers in world wide web then their Dijsktra algorithm is used in calculating the routing tables..

(C) will be best
Answer:

Related questions

6 votes
6 votes
1 answer
2
vaishali jhalani asked Nov 5, 2016
2,996 views
What is the time complexity of Dijkstra’s algorithm if it is implemented using AVL Tree instead of Priority Queue over a graph G = (V, E)?
1 votes
1 votes
1 answer
3
vaishali jhalani asked Nov 4, 2016
1,049 views
When the graph contain negetive weight edges but no negetive weight cycle, in this case can dijkstra leads to incorrect result?