NETWORK LAYER
UNICAST ROUTING
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
Which of the algorithm uses the concept of best spanning tree?
|
|
Path vector
|
|
|
distance vector
|
|
|
link state
|
|
|
none of the mentioned
|
Explanation:
Detailed explanation-1: -The advantage of Prim’s algorithm is its complexity, which is better than Kruskal’s algorithm. Therefore, Prim’s algorithm is helpful when dealing with dense graphs that have lots of edges. However, Prim’s algorithm doesn’t allow us much control over the chosen edges when multiple edges with the same weight occur.
There is 1 question to complete.