Link State algorithms build what to 'see' the entire path to the destination network?

• A. Forwarding Table
• B. Topology Table
• C. Routing Vector
• D. Neighbor Table

Answer: (B)

Link-state routing creates a complete map of the network so every router can compute the best path to all destinations. Routers exchange link-state advertisements and build a topology map, stored in the topology table (the link-state database). With this full view, each router runs an algorithm to determine the shortest paths to every network and then uses those results to populate its forwarding information. That’s why the topology table is the correct choice: it’s the collection that represents the entire network layout, enabling sight of the full path to any destination.

The forwarding table is what actually moves packets based on the chosen paths, not the network-wide view itself. A neighbor table only lists directly connected neighbors, not the whole topology. A routing vector isn’t a standard term used for describing how link-state protocols view the network.