RIP is a ________________ algorithm and uses ____________ for its algorithm metrics.

• A. Distance Vector, Hop Count
• B. Link State, Dijkstra's Shortest Path First
• C. Distance Vector, Bandwidth
• D. Hybrid, Metric

Answer: (D)

RIP operates using a distance-vector routing approach, where each router shares its routing information with directly connected neighbors and builds its table from the routes learned from those neighbors. The metric RIP uses to choose the best path is hop count—the number of routers a packet must pass through to reach the destination. The route with the fewest hops is preferred, and destinations beyond 15 hops are considered unreachable. This distinction helps explain why RIP is described as a distance-vector algorithm using hop count for its metrics, and it contrasts with link-state protocols (which use a full network map and algorithms like Dijkstra) or metrics based on bandwidth or more complex composites.