Distance Vector Routing Quiz

What is the primary basis of distance vector routing?

• Link state of all routers

• Cost to reach each node

• IP address of the sender

• MAC address of each router

In distance vector routing, how often are routing tables typically exchanged between routers?

• Only on demand

• Once every second

• Periodically

• Never

Which algorithm is commonly associated with distance vector routing?

• Dijkstra's Algorithm

• Kruskal's Algorithm

• Bellman-Ford Algorithm

• A* Algorithm

What information does a router share with its neighbors in distance vector routing?

• Complete network topology

• Only the next hop

• Its entire routing table

• Only unreachable routes

What is the "count to infinity" problem in distance vector routing?

• A problem where routing tables shrink over time

• A condition where packets loop infinitely

• A situation where routers take a long time to converge

• An issue where TTL reaches zero

Which technique is used to prevent routing loops in distance vector protocols?

• Shortest path first

• Split horizon

• Load balancing

• Token passing

What does “split horizon with poison reverse” do?

• Speeds up route calculation

• Prevents route advertisement back on the same interface it was learned

• Deletes all unreachable routes

• Encrypts routing tables

Which of the following is a distance vector routing protocol?

• OSPF

• IS-IS

• RIP

• BGP

What metric does RIP use to determine the best path?

• Bandwidth

• Delay

• Hop count

• Reliability

What is the maximum number of hops allowed in RIP to avoid the count-to-infinity problem?

• 8

• 12

• 15

• 32