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)

The Gateway to Computer Science Excellence

+9 votes

Djikstra’s algorithm is used to

- Create LSAs
- Flood an internet with information
- Calculate the routing tables
- Create a link state database

+13 votes

Best answer

+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

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)

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

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

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.3k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.1k
- Non GATE 1.5k
- Others 1.5k
- Admissions 595
- Exam Queries 576
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 17

50,644 questions

56,503 answers

195,553 comments

101,034 users