MCQs City stays free thanks to ads. Please turn off your ad blocker for this site so content and features keep working.
Computer Networks
Dv Routing Algorithms
Q
Which statement is correct about routing tables in distance vector routing?
AA. Routing tables have entry for only immediate neighbouring nodes
BB. Routing tables have entry for all the nodes in the network
CC. Routing tables have entry for those nodes who have minimum distance
DD. Routing tables have entry for those nodes who have maximum distance
Correct Answer:
B. B. Routing tables have entry for all the nodes in the network
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.
