_______ computes shortest paths in a graph by using weights on edges as a measure of distance.
- AGreedy algorithm
- BDistance vector algorithm
- CDijkstra's algorithm
- DNon of the given
Dijkstra's algorithm finds least-weight paths using edge weights as distances.
Which of the following statement is true regarding Distance-vector routing?
- AIt is very simple to implement.
- BPacket switch updates its own routing table first.
- CIt is used in RIP.
- DAll of the above
Distance-vector routing is simple, each switch updates its own table first, and RIP uses it.
Which of the following statement is true regarding Link-state routing?
- ANetwork topology is separated from route computation.
- BEach switch builds its own routing tables.
- CLink-state routing uses Djikstra’s algorithm.
- DAll of the above
In link-state routing each switch learns topology and computes its own table with Dijkstra's algorithm.
Which one of the following is the responsibility of Djikstra’ algorithm?
- ATo compute the shortest path between two nodes
- BTo extract next hop information from path information
- CTo insert next hop information into routing table
- DAll of the above
The procedure computes shortest paths, extracts next hops and inserts them into routing tables.
Djikstra’s algorithm is used to compute the……………….
- Ashortest path between two nodes
- Bnumber of nodes used in the network
- Cdistance between different nodes
- Dnone of the above
Dijkstra's algorithm computes shortest paths in a weighted graph.