Ccna Two Chapter X 2011 V4.0 Answers 100%

1. What activity does a link-state router accept straight off 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 goal network
2. Why is it hard for routing loops to travel on inwards networks that role link-state routing?
Each router builds a uncomplicated thought of the network based on hop count.
Routers alluvion the network amongst LSAs to discovery routing loops.
Each router builds a consummate as well as synchronized thought of the network.
Routers role hold-down timers to forestall routing loops.

3.

Refer to the exhibit. What form of information would live seen inwards an LSP sent from router JAX to router ATL?
hop count
uptime of the route
cost of the link
a listing of all the routing protocols inwards use
4. To make network convergence, what 3 steps does each link solid soil router take? (Choose three.)
role automatic summarization to cut down the size of routing tables
build a Link State Packet (LSP) containing the solid soil of each direct connected link
flood the LSP to all neighbors, who as well as thence shop all LSPs received inwards a database
discovery neighbors as well as flora adjacencies using the howdy packet sent at regular intervals
construct a consummate map of the topology as well as compute the best path to each goal network
role the DUAL FSM to select efficient, loop-free paths, as well as insert routes into the routing table
5.

Refer to the exhibit. When Router D is configured to role a link-state routing protocol as well as is added to the network, what is the starting fourth dimension matter that it does to start out learning the network topology?
It sends LSP packets to Routers B as well as C.
It sends LSP packets to all routers inwards the network.
It sends Hello packets to all routers inwards the network.
It sends information virtually its direct connected neighbors to Routers Influenza A virus subtype H5N1 as well as E.
It sends information virtually its direct connected neighbors to all routers inwards the network.
It learns virtually its direct connected networks when its interfaces laissez passer on the upwards state.
6. Influenza A virus subtype H5N1 novel network administrator is given the chore of selecting an appropriate dynamic routing protocol for a software evolution company. The fellowship has over 100 routers, uses CIDR as well as VLSM, requires fast convergence, as well as uses both Cisco as well as non-Cisco equipment. Which routing protocol is appropriate for this company?
RIP version 2
IGRP
EIGRP
OSPF
BGP
7. What 2 events volition campaign a link solid soil router to post LSPs to all neighbors? (Choose two.)
thirty minute timer expires
whenever the network topology changes
straight off subsequently the Bellman-Ford algorithm has run
straight off subsequently the DUAL FSM has built the topology database
upon initial startup of router or routing protocol
8. What is the lastly stride inwards the link solid soil routing process?
successors are placed into the routing table
SPF computes best path to each goal network
LSPs are flooded to all neighbors to converge the network
DUAL algorithm is run to honour best path to goal networks
9.

Refer to the exhibit. What does JAX create amongst link-state packets from ORL?
sends out its updated routing tabular array to both ORL as well as BOS routers
sends out the private link-state packets out the interface connected to BOS
queries BOS to meet if it has a amend route
alone adds it to the local routing tabular array as well as performs no other actions
10. What 2 statements correctly depict the link solid soil routing process? (Choose two.)
each router inwards the surface area floods LSPs to all neighbors
all routers inwards the surface area have got identical link solid soil databases
LSPs role the reserved multicast address of 224.0.0.10 to laissez passer on neighbors
routing loops are prevented past times running the Diffusing Update Algorithm (DUAL)
Reliable Transport Protocol (RTP) is the protocol used past times for the delivery as well as reception of LSPs
11. Which database or tabular array must live identical on all link-state routers inside an surface area inwards lodge to prepare an accurate SPF tree?
routing table
adjacency table
link-state database
vecino table
topology database
12.

Refer to the exhibit. Which contention correctly describes the path traffic would accept from the 10.0.0.0/24 network to the 192.168.1.0/24 network if a link-state routing protocol was inwards use?
BOS -> ATL because this path is the to the lowest degree hops
BOS -> ATL because this path is highest cost
BOS -> ORL -> JAX -> ATL because this path is the lowest cost
traffic would charge residuum across all links
13. What characteristic create modern link-state protocols furnish to minimize processing as well as retention requirements?
splitting routing topologies into smaller areas
assigning lower procedure priorities to road calculations
using update timers to restrain routing updates
strict separate horizon rules to cut down routing tabular array entries
14. What speeds upwards convergence inwards a network using link-state routing?
updates triggered past times network changes
updates sent at regular intervals
updates sent alone to direct connected neighbors
updates that include consummate routing tables
15. Which algorithm is run past times link-state routing protocols to calculate the shortest path to goal networks?
DUAL
Dijkstra
Bellman-Ford
Diffie-Hellman
16. What are unopen to of the advantages of using a link-state routing protocol instead of a distance vector routing protocol? (Choose two.)
The topology database eliminates the postulate for a routing table.
Frequent periodic updates are sent to minimize the seat out of wrong routes inwards the topological database.
Routers have got direct cognition of all links inwards the network as well as how they are connected.
After the inital LSA flooding, they to a greater extent than oftentimes than non require less bandwidth to communicate changes inwards a topology.
Link-state protocols require less router processor ability than distance vector protocols.
17.

Refer to the exhibit. If all routers as well as interfaces are configured to role a link-state routing protocol, from which routers volition router D have howdy packets?
Influenza A virus subtype H5N1 as well as E
B as well as C
A, B, C, as well as E
C only
18. Which 2 routing protocols role Dijkstra’s shortest path starting fourth dimension algorithm? (Choose two.)
RIPv1
RIPv2
IS-IS
BGP
EIGRP
OSPF
19. When are link-state packets sent to neighbors?
every thirty seconds
every 180 seconds
subsequently the holddown fourth dimension expires
when a link goes upwards or down
when a routing loop occurs
20. What are 2 advantages of using a link-state routing protocol instead of a distance vector routing protocol? (Choose two.)
The topology database eliminates the postulate for a routing table.
Each router independently determines the road to each network.
Link-state protocols require less router processor ability than distance vector protocols.
After the inital LSP flooding, they to a greater extent than oftentimes than non require less bandwidth to communicate changes inwards a topology.
Frequent periodic updates are sent to minimize the seat out of wrong routes inwards the topological database.
21. To make network convergence, what 3 steps does each link solid soil router take? (Choose three.)
use automatic summarization to cut down the size of routing tables
build a Link State Packet (LSP) containing the solid soil of each direct connected link
flood the LSP to all neighbors, who as well as thence shop all LSPs received inwards a database
post howdy packages at regular intervals to discovery neighbors as well as flora adjacencies
construct a consummate map of the topology as well as compute the best path to each goal network
role the DUAL FSM to select efficient, loop-free paths, as well as insert routes into the routing table