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

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

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

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

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

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

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
• D. Reverse path broadcasting

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

• A. Link state routing
• B. Unicast distance vector routing
• C. Multicast distance vector routing
• D. Multiple routing

Distance vector routing is a dynamic routing algorithm.

• A. True
• B. False
• C.
• D.

Cookies were originally designed for ____________

• A. Client side programming
• B. Server side programming
• C. Both client side programming and server side programming
• D. Socket programming