🎙 Free live masterclass · Sun, 29 Nov, 7:00 pm IST · Java Full Stack roadmap Register free →
Skills101
← Quiz: Routing Algorithms: all 10 questions

Quiz: Routing Algorithms · Question 2 of 10

Which equation does distance-vector routing use?

Which equation does distance-vector routing use?

  1. A.D(A, x) = cost(A, x) only
  2. B.D(A, x) = max over neighbours [cost(A, v) + D(v, x)]
  3. C.D(A, x) = min over neighbours [cost(A, v) + D(v, x)]
  4. D.D(A, x) = number of routers in the network
Answer & explanation

Correct answer: D(A, x) = min over neighbours [cost(A, v) + D(v, x)]

This is the Bellman-Ford equation.

Can you get the rest right without peeking?

Take the timed Quiz: Routing Algorithms quiz free. Pass it to earn XP and count towards your certificate.

Start the quiz →