CCNA #10!!

1. A new network administrator is given the task of selecting an appropriate dynamic routing protocol for a software development company. The company has over 100 routers, uses CIDR and VLSM, requires fast convergence, and uses both Cisco and non-Cisco equipment. Which routing protocol is appropriate for this company?

RIP version 2

IGRP

EIGRP

OSPF

BGP

2. Refer to the exhibit. What kind of information would be seen in an LSP sent from router JAX to router ATL?

Hop count

Uptime of the route

Cost of the link

A list of all the routing protocols in use

3. What two events will cause a link state router to send LSPs to all neighbors? (Choose two)

30 second timer expires

Whenever the network topology changes

Immediately after the Bellman-Ford algorithm has run

Immediately after the DUAL FSM has built the topology database

Upon initial startup of router or routing protocol

Submit

4. Which algorithm is run by link-state routing protocols to calculate the shortest path to destination networks?

DUAL

Dijkstra

Bellman-Ford

Diffie-Hellman

5. What speeds up convergence in a network using link-state routing?

Updates triggered by network changes

Updates sent at regular intervals

Updates sent only to directly connected neighbors

Updates that include complete routing tables

6. When are link-state packets sent to neighbors?

Every 30 seconds

Every 180 seconds

After the holddown time expires

When a link goes up or down

When a routing loop occurs

7. What action does a link-state router take immediately upon receipt of an LSP from a neighboring router?

Floods the LSP to neighbors

Calculates the SPF algorithm

Runs the Bellman-Ford algorithm

Computes the best path to the destination network

8. Which two routing protocols use Dijkstra’s shortest path first algorithm? (Choose two.)

RIPv1

RIPv2

IS-IS

BGP

OSPF

Submit

9. What feature do modern link-state protocols provide to minimize processing and memory requirements?

Splitting routing topologies into smaller areas

Assigning lower process priorities to route calculations

Using update timers to restrict routing updates

Strict split horizon rules to reduce routing table entries

10. Refer to the exhibit. Which statement correctly describes the path traffic would take from the 10.0.0.0/24 network to the 192.168.1.0/24 network if a link-state routing protocol was in use?

BOS -> ATL because this path is the least hops

BOS -> ATL because this path is highest cost

BOS -> ORL -> JAX -> ATL because this path is the lowest cost

Traffic would load balance across all links

11. Refer to the exhibit. What does JAX do with link-state packets from ORL?

Sends out its updated routing table to both ORL and BOS routers

Sends out the individual link-state packets out the interface connected to BOS

Queries BOS to see if it has a better route

Only adds it to the local routing table and performs no other actions

12. Which routers will router D receive hello packets?

A and E

B and C

A, B, C, and E

C only

13. Why is it difficult for routing loops to occur in networks that use link-state routing?

Each router builds a simple view of the network based on hop count.

Routers flood the network with LSAs to discover routing loops.

Each router builds a complete and synchronized view of the network.

Routers use hold-down timers to prevent routing loops.

14. Which database or table must be identical on all link-state routers within an area in order to construct an accurate SPF tree?

Routing table

Adjacency table

Link-state database

Neighbor table

Topology database

15. What is the final step in the link state routing process?

Successors are placed into the routing table

SPF computes best path to each destination network

LSPs are flooded to all neighbors to converge the network

DUAL algorithm is run to find best path to destination networks

16. What two statements correctly describe the link state routing process? (Choose two.)

All routers in the area have link state databases

Each router in the area floods LSPs to all neighbors

LSPs use the reserved multicast address of 224.0.0.10 to reach neighbors

Routing loops are prevented by running the Diffusing Update Algorithm (DUAL)

Reliable Transport Protocol (RTP) is the protocol used by for the delivery and reception of LSPs

Submit

17. What are two advantages of using a link-state routing protocol instead of a distance vector routing protocol? (Choose two.)

The topology database eliminates the need for a routing table.

Each router independently determines the route to each network.

Link-state protocols require less router processor power than distance vector protocols

After the inital LSP flooding, they generally require less bandwidth to communicate changes in atopology.

Frequent periodic updates are sent to minimize the number of incorrect routes in the topologicaldatabase.

Submit

CCNA #10!!

2.

What first name or nickname would you like us to use?

2. Refer to the exhibit. What kind of information would be seen in an LSP sent from router JAX to router ATL?

3. What two events will cause a link state router to send LSPs to all neighbors? (Choose two)

4. Which algorithm is run by link-state routing protocols to calculate the shortest path to destination networks?

5. What speeds up convergence in a network using link-state routing?

6. When are link-state packets sent to neighbors?

7. What action does a link-state router take immediately upon receipt of an LSP from a neighboring router?

8. Which two routing protocols use Dijkstra’s shortest path first algorithm? (Choose two.)

9. What feature do modern link-state protocols provide to minimize processing and memory requirements?

10. Refer to the exhibit. Which statement correctly describes the path traffic would take from the 10.0.0.0/24 network to the 192.168.1.0/24 network if a link-state routing protocol was in use?

11. Refer to the exhibit. What does JAX do with link-state packets from ORL?

12. Which routers will router D receive hello packets?

13. Why is it difficult for routing loops to occur in networks that use link-state routing?

14. Which database or table must be identical on all link-state routers within an area in order to construct an accurate SPF tree?

15. What is the final step in the link state routing process?

16. What two statements correctly describe the link state routing process? (Choose two.)

17. What are two advantages of using a link-state routing protocol instead of a distance vector routing protocol? (Choose two.)