Routing Algorithms

Which of the following routing algorithms can be used for network layer design?

• shortest path algorithm

• distance vector routing

• link state routing

• all of the mentioned

What is the function of the router?

• converting the data from one format to another

• Forward the packet to the up links

• error detection in data

• None of the above

What does Router do in a network?

• Forwards a packet to all outgoing links

• Forwards a packet to the next free outgoing link

• Determines on which outing link a packet is to be forwarded

• Forwards a packet to all outgoing links except the originated link

Routing tables of a router keeps track of

• MAC Address Assignments

• Port Assignments to network devices

• Distribute IP address to network devices

• Routes to use for forwarding data to its destination

Distance vector algorithm uses ---------------------equation to find the least cost route.

• Euclid

• Floyd Warshall

• Bellman Ford

• Pythagorus

In Link state routing a link represents-----------

• a host

• a network

• a packet

• none of the mentioned

Link State packets are transmitted through----

• flooding

• multicast routing

• unicast routing

• through any of the mentioned

Link state routing uses------------- algorithm.

• Quick Sort Algorithm

• Floyd Warshall Algorithm

• Bellman Ford

• Dijkstra's

Which of the following is not a least cost algorithm?

• Distance vector

• Link state

• Path vector

• All the mentioned

Which of the algorithm uses the concept of best spanning tree?

• Path vector

• distance vector

• link state

• none of the mentioned