search
Log In
11 votes
3.5k views

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
in Algorithms 3.5k views
0

calculation of routing table is done in case of distance vector routing for which we use bellman ford algorithm. For link state routing we use Djikstra’s  so answer should be (A)

0
@lovely gupta  ya that is for sure bellman ford is used in DVR but can u give me the refrence where it is mentioned that dijikstra is used in LSP

3 Answers

14 votes
 
Best answer

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 vote

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

I think the answer is c) calculation of routing tables as djikstra algorithm calculates shortest path for all the nodes ..

plz check this [email protected]

0
LSA refer to link state advertisement and not Link state algorithm.
0
what is the difference u mean by advertisement and algorithm?
0
These are a type of special messages exchanged between the routers which include the information of cost of links between routers.(Type 1)

Or the information that helps to reduce the amount of data to  stored in each node by partitioning the domain of routers into areas such that a router within the domain does not need to know how to reach every network in that domain but knows only how to get into right areas(from where  the packet can be routed towards its destination correctly).(Type 2)
1 vote
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

3 votes
1 answer
1
371 views
Which of the following statements is/are correct with respect to Djikstra Algorithm? (P) It always works perfectly for graphs with negative weight edges. (Q) It does not work perfectly for graphs with negative weight cycles. (R) It may or may not work for graphs with negative weight edges. (S) It ... Only P, Q, S, T and U are correct Only Q, R, T are correct Only Q, R, S, T and U are correct
asked Dec 27, 2018 in Algorithms Ruturaj Mohanty 371 views
1 vote
1 answer
2
6 votes
1 answer
4
1.7k 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)?
asked Nov 5, 2016 in Algorithms vaishali jhalani 1.7k views
...