1. Which of the following OSPF components is associated with the neighbor table?
- Dijkstra’s algorithm
- Link-State database
- Routing protocol messages
- Adjacency database
- Forwarding database
2. Which of the following OSPF components is responsible for computing the cost of each route?
- Dijkstra’s algorithm
- Link-State database
- Routing protocol messages
- Adjacency database
- Forwarding database
3. Which of the following OSPF components is associated with the topology table?
- Dijkstra’s algorithm
- Link-State database
- Routing protocol messages
- Adjacency database
- Forwarding database
4. Which of the following OSPF components is associated with the routing table?
- Dijkstra’s algorithm
- Link-State database
- Routing protocol messages
- Adjacency database
- Forwarding database
5. What is the correct order in the steps for Link-State operation?
- 1. Execute the SPF Algorithm
2. Establish Neighbor Adjacencies
3. Exchange Link-State Advertisements
4. Choose the Best Route
5. Build the Topology Table - 1. Establish Neighbor Adjacencies
2. Choose the Best Route
3. Build the Topology Table
4. Execute the SPF Algorithm
5. Exchange Link-State Advertisements - 1. Establish Neighbor Adjacencies
2. Exchange Link-State Advertisements
3. Execute the SPF Algorithm
4. Choose the Best Route
5. Build the Topology Table - 1. Establish Neighbor Adjacencies
2. Exchange Link-State Advertisements
3. Build the Topology Table
4. Execute the SPF Algorithm
5. Choose the Best Route