Routing Algorithms

Routing Algorithms

Multiple Choice

Routers operates in

• Data link layer

• Network layer

• Application layer

• Physical Layer

Multiple Choice

Count-to-Infinity problem occurs in .....................

• distance vector routing

• short path first

• link state routing

• hierarchical routing

Multiple Choice

ARP stands for

• Address Routing Protocol

• Address Resolution Protocol

• Address Routing Packet

• Address Routing Program

Multiple Choice

If two or more routers are available in distributed routing, which route should be selected

• High possible cost

• Least possible cost

• Link cost

• Both b & c

Multiple Choice

In link state routing, after the construction of link state packets new routes are computed using .....................

• Bellman Ford algorithm

• DES algorithm

• Dijkstra's algorithm

• Leaky bucket algorithm

Multiple Choice

Link state packets are built in ....................

• short path first

• distance vector routing

• link state routing

• hierarchical routing

Multiple Choice

In which routing method do all the routers have a common database?

• Distance Vector

• Link Vector

• Shortest path

• Link State

Multiple Choice

In distance vector routing algorithm, the routing tables are updated .....................

• by exchanging information with the neighbours

• automatically

• using the backup database

• by the server

Multiple Choice

In link state routing, after the construction of link state packets new routes are computed using .....................

• Bellman Ford algorithm

• DES algorithm

• Dijkstra's algorithm

• Leaky bucket algorithm