Skills101
← All practice quizzes

Quiz: Routing Algorithms

5 questions · new set on every retakeNo time limitPass: 60%+10 XP on first pass

How routers find the best path across a network — link-state routing with Dijkstra's algorithm, distance-vector routing with Bellman-Ford, the count-to-infinity problem and its fixes, and where RIP, OSPF and BGP fit — with working Python code.

Log in to take the quiz

Free account · see your score, answers and explanations, earn XP

  1. Question 1

    In link-state routing, what does each router know before it computes routes?

  2. Question 2

    Which equation does distance-vector routing use?

  3. Question 3

    In the lesson's network, why is A's best route to B through C?

  4. Question 4

    Router X has neighbours Y (cost 3) and Z (cost 1). Y says its distance to network N is 2; Z says 6. What is X's distance to N?

  5. Question 5

    What is the count-to-infinity problem?

🎯 Today’s placement challenge — 10 questions, no login. Can you score 10/10?Take today’s challenge →