# Computer Networks Questions & Answers – DV Routing Algorithms

This set of Computer Networks Multiple Choice Questions & Answers (MCQs) focuses on “DV Routing Algorithms”.

1. What is the other name for distance vector routing algorithm?
a) Ford and Fullman algorithm
b) Bellman – Ford algorithm
c) Ford and Fulkerson algorithm
d) Bellman – Fulkerson algorithm

Explanation: DVR is a dynamic and intra-domain routing protocol which is developed by Bellman and ford. It is the evolved version of the original ARPANET and it is more efficient than flooding.

2. How tables are updated in the distance vector routing algorithm?
a) Using flooding technique
b) By retrieving the information from all the nodes directly
c) By interchanging the information with neighbour nodes
d) By exchanging the information with a central device

Explanation: In distance vector routing algorithm, routing tables exchange their information only with their neighbour nodes. So, gradually tables will be updated with least distance routes for each destination and it will have information about next hop for each route.

3. Which of the following is not a similarity between flooding and distance vector routing?
a) Finding shortest paths
b) Using less setup
c) Using local knowledge
d) Using hop count metric

Explanation: Both flooding technique and distance vector routing are used to find shortest paths for the destinations. But flooding requires less setup than DVR because, nodes in it need to know information about their neighbors only. And it needs less memory with less setup.

4. Which statement is correct about routing tables in distance vector routing?
a) Routing tables have entry for only immediate neighbouring nodes
b) Routing tables have entry for all the nodes in the network
c) Routing tables have entry for those nodes who have minimum distance
d) Routing tables have entry for those nodes who have maximum distance

Explanation: In distance vector routing, routing tables have single entry for each node which is present in the network. But each router exchanges the information with neighboring nodes only.

5. 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?
a) Maximum distance in the routing table of the node
b) Minimum distance in the routing table of the node
c) Infinite distance that is unreachable
d) Total sum of the distances in the routing table

Explanation: In DVR, if nodes are neighbors, they can send messages to find distance between them. But if the nodes are not neighbors then the distance between them is infinite initially. Later this infinity will be replaced with distance by the router.

6. What update can it be called, if a node sends its routing table to its neighbors if there are any modifications in the routing table?
a) Frequent update
b) Periodic update
c) Triggered update
d) Continuous update

Explanation: Triggered update may happen when there is change in the routing table of the node or failure of neighboring links. It can happen at any time if a node is subjected to changes.

7. Which protocols are considered as intra-domain routing protocols?
a) Distance vector and link state routing
b) Distance vector and path vector routing
c) Path vector and link state routing
d) Only a path vector routing

Explanation: Distance vector routing and link state routing are used with in an autonomous system and cannot work well in between autonomous systems. Scalability differs between intra-domain and inter-domain routing protocols.

8. Which technique can be used in multicast routing to overcome the problem of count-to-infinity which occurs in distance vector routing?
a) Reverse path multi-casting
b) Flooding
c) Reverse path forwarding

Explanation: Basically, flooding in distance vector routing causes the loops in multicast routing. In order to overcome this problem, reverse path forwarding does not allow the router to send the packets to the link that on which it has received the packet.

9. Which routing does not permit the router to send its routing table to its neighboring nodes?
b) Unicast distance vector routing
c) Multicast distance vector routing
d) Multiple routing

Explanation: Multicast distance vector routing uses the multicast routing technique and source based trees. Router uses its own uni-cast routing table and evanescent shortest path trees for forwarding packets instead of exchanging routing table for information.

10. Distance vector routing is a dynamic routing algorithm.
a) True
b) False

Explanation: Dynamic routing uses dynamic routing tables and these routing tables make use of dynamic routing protocols. The routing tables update themselves dynamically, according to the changes in the inter network.

Sanfoundry Global Education & Learning Series – Computer Networks.

To practice all areas of Computer Networks, here is complete set of 1000+ Multiple Choice Questions and Answers.

If you find a mistake in question / option / answer, kindly take a screenshot and email to [email protected]