← 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?
- A.D(A, x) = cost(A, x) only
- B.D(A, x) = max over neighbours [cost(A, v) + D(v, x)]
- C.D(A, x) = min over neighbours [cost(A, v) + D(v, x)]
- 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 →