Computer Networks CT-4

What is the other name for distance vector routing algorithm?

• Ford and Fullman algorithm

• Bellman – Ford algorithm

• Ford and Fulkerson algorithm

• Bellman – Fulkerson algorithm

What is the default distance between two nodes in the initial routing table, if these two nodes are not immediate neighbors in distance vector routing?

• Infinite distance that is unreachable

• Maximum distance in the routing table of the node

• Minimum distance in the routing table of the node

• Total sum of the distances in the routing table

A _________ is a device that forwards data that is not explicitly destined to it.

• hub

• switch

• router

• All of the above

An __________ distributes routing information between two different autonomous systems or organization.

• Exterior Routing Protocol

• Interior Routing Protocol

• Link-State Routing Protocol

• Distance Vector Routing Protocol

 ________ is an upgraded implementation of ICMP to accommodate IPv6 requirements.

• DHCPv6

• DNS

• ICMPv6

• None of the above

Which routing does not permit the router to send its routing table to its neighboring nodes?

• Link state routing

• Unicast distance vector routing

• Multicast distance vector routing

• Multiple routing

Which one of the following is not a function of network layer?

• routing

• inter-networking

• congestion control

• error control

In virtual circuit network each packet contains ___________.

• a short VC number

• full source and destination address

• only source address

• only destination address

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

• distance vector routing

• shortest path algorithm

• link state routing

• all of the mentioned

ICMP is primarily used for __________

• error and diagnostic functions

• addressing

• forwarding

• routing