Djikstra’s algorithm is used to
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)
answer is c)
Calculation of routing tables ,as djikstra algorithm calculates shortest path for all
the nodes in link state routing protocol .
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
I think the answer is c) calculation of routing tables as djikstra algorithm calculates shortest path for all the nodes ..
plz check this ...@srestha
^ go through