Question : Why is link-state routing considered more efficient than distance vector routing?
Solution :
Correct Answer : It maintains a complete network topology and avoids routing loops
Description -
Question : Which phase ensures that every router has the same network topology information?
Solution :
Correct Answer : Reliable Flooding
Description -
Question : What is the role of the sequence number in LSP/LSA packets?
Solution :
Correct Answer : To identify duplicate or outdated information
Description -
Question : Which algorithm is used in link-state routing to determine the shortest path?
Solution :
Correct Answer : Dijkstra’s Algorithm
Description -
Question : What is the primary function of Link State Advertisements (LSAs) in link-state routing?
Solution :
Correct Answer : To distribute information about directly connected links to all routers
Description -
Question : Which of the following is a major disadvantage of Distance Vector Routing?
Solution :
Correct Answer : Slow convergence and routing loops
Description -
Question : What metric is primarily used in Distance Vector Routing (e.g., in RIP)?
Solution :
Correct Answer : Hop count
Description -
Question : In Distance Vector Routing, routers share routing information:
Solution :
Correct Answer : Only with directly connected neighbors
Description -
Question : The Distance Vector Routing Algorithm is based on which of the following algorithms?
Solution :
Correct Answer : Bellman-Ford Algorithm
Description -
Question : Which of the following characteristics is NOT associated with the Distance Vector Routing Algorithm?
Solution :
Correct Answer : Centralized
Description -
Question : Which of the following best differentiates adaptive and non-adaptive routing?
Solution :
Correct Answer : Adaptive considers topology and traffic
Description -
Question : Which routing method sends packets to a random neighbor node?
Solution :
Correct Answer : Random Walk
Description -
Question : Which statement is correct about Non-Adaptive Routing?
Solution :
Correct Answer : It uses pre-defined routing tables
Description -
Question : What is the main disadvantage of the flooding algorithm?
Solution :
Correct Answer : Packet duplication
Description -
Question : Which of the following is a type of Non-Adaptive Routing Algorithm?
Solution :
Correct Answer : Flooding
Description -
Question : In which type of routing algorithm does each node only have knowledge of its directly connected links?
Solution :
Correct Answer : Distributed algorithm
Description -
Question : Which routing algorithm uses global knowledge of the network to compute the shortest path?
Solution :
Correct Answer : Centralized algorithm
Description -
Question : Adaptive routing algorithms are also known as:
Solution :
Correct Answer : Dynamic routing
Description -
Question : Which of the following metrics is NOT typically used by routing algorithms?
Solution :
Correct Answer : Temperature
Description -
Question : What is the primary goal of a routing algorithm in a computer network?
Solution :
Correct Answer : To determine the least-cost path between source and destination
Description -