COMPUTER SCIENCE AND ENGINEERING
ALGORITHMS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
Distance vector algorithm uses ____ equation to find the least cost route.
|
|
Euclid
|
|
|
Floyd Warshall
|
|
|
Bellman Ford
|
|
|
Pythagorus
|
Explanation:
Detailed explanation-1: -Distance vector routing algorithm is also called as Bellman-Ford algorithm or Ford Fulkerson algorithm as this algorithm is used to find the shortest route from one node to another node in the network.
Detailed explanation-2: -With the Distance Vector Routing algorithm, the node x contains the following routing information: For each neighbor v, the cost c(x, v) is the path cost from x to directly attached neighbor, v. The distance vector x, i.e., Dx = [ Dx(y) : y in N ], containing its cost to all destinations, y, in N.
Detailed explanation-3: -The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph.
There is 1 question to complete.