CCNA Free Online Model Tests

Thank you very much for taking test

Test your caliber

1. 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

2. 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

3. What two statements correctly describe the link state routing process?
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)

4. 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

5. What two events will cause a link state router to send LSPs to all neighbors?
30 second timer expires	whenever the network topology changes
immediately after the Bellman-Ford algorithm has run	upon initial startup of router or routing protocol

6. 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

7. 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

8. 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

9. 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

10. What are two advantages of using a link-state routing protocol instead of a distance vector routing protocol?
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 a topology

11. Which algorithm is run by link-state routing protocols to calculate the shortest path to destination networks?
DUAL	Dijkstra
Bellman-Ford	Diffie-Hellman

12. Refer to the exhibit. Which hosts will receive a broadcast frame sent from Host A?
hosts A and B	hosts D and E
hosts A, B, and C	hosts A, B, C, D, and E

13. 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

14. 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

15. Which two routing protocols use Dijkstra’s shortest path first algorithm?
RIPv1	RIPv2
IS-IS	OSP

16. Refer to the exhibit. Router B receives a packet with a destination address of 10.16.1.97. What will router B do?
drop the packet	forward the packet via the route to 10.16.1.0
forward the packet via the route to 10.16.1.64	use the default route

17. A network is converged and the routing tables are complete. When a packet needs to be forwarded, what is the first criterion used to determine the best path in the routing table?
the route with the smallest AD	the route with the longest address and mask match to the destination
the route with the highest bandwidth	the route with the best combination of AD and lowest cost

18. Refer to the exhibit. Which statement correctly describes this network?
they are dropped	sent to default gateway
forward out interface Serial0/0/1	forward out interface FastEthernet 0/0

19. The following entry is displayed in the routing table: R 192.168.8.0/24 [120/2] via 192.168.4.1, 00:00:26, Serial0/0/1 What type of route is this?
a level 1 parent route	a level 1 supernet route
a level 1 ultimate network route	a level 2 child route

20. What determines if the router implements a classless route lookup process?
Child routes are present in the routing table	A classless routing protocol has been configured on the router
The command ip classless is enabled on the router	Multiple routes with different masks to the same destination are in the routing table