Routing Algorithms: Master the Core Concepts for Network Administration

Question 1

Which routing algorithm maintains a complete topological map of the network at each router?

Accepted Answer

Link-state

Answer

RIP

Answer

Hierarchical

Answer

Distance vector

Question 2

In a distance vector routing algorithm, what data is exchanged between routers?

Accepted Answer

Distance to destination and next hop

Answer

Number of hops to each destination

Answer

Link bandwidth information

Answer

Entire network topology

Question 3

Which characteristic does NOT describe the RIP routing protocol?

Accepted Answer

Employs a link-state algorithm

Answer

Has a restricted hop count

Answer

Utilizes hop count as a metric

Question 4

What primary function does a routing table perform in a network device?

Accepted Answer

Determines optimal data packet paths to destinations

Answer

Manages network security parameters

Answer

Stores network configurations

Question 5

How does a link-state algorithm respond to network topology changes?

Accepted Answer

Propagates updates to all network routers

Answer

Depends on a central entity for change management

Answer

Exchanges information solely with immediate neighbors

Answer

Relies on a static routing table

Question 6

Distance-vector routing algorithms may encounter which potential issue?

Accepted Answer

Routing loops

Answer

Excessive bandwidth consumption

Answer

Complex setup

Answer

Slow convergence

Question 7

In hierarchical routing, what is the primary purpose of an autonomous system?

Accepted Answer

Groups networks under a single administrative domain

Answer

Optimizes network performance

Answer

Centralizes routing control

Question 8

When troubleshooting a network where data packets are taking an unexpected route, which routing concept should be investigated initially?

Accepted Answer

Routing table updates and convergence

Answer

Network security settings

Answer

Device hardware specifications

Answer

Link bandwidth allocation