SlideShare a Scribd company logo
www.ccnafinal.net www.ccnafinalexam.com www.ccnaanswers.org www.ccna4u.net
                      www.ccna4u.org www.ccna4u.info


CCNA 2 Chapter 10 V4.0 Answers

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

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.




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

4. To achieve network convergence, what three steps does each link state router
take? (Choose three.)
use automatic summarization to reduce the size of routing tables
build a Link State Packet (LSP) containing the state of each directly connected link
flood the LSP to all neighbors, who then store all LSPs received in a database
www.ccnafinal.net www.ccnafinalexam.com www.ccnaanswers.org www.ccna4u.net
                      www.ccna4u.org www.ccna4u.info

discover neighbors and establish adjacencies using the hello packet sent at regular
intervals
construct a complete map of the topology and compute the best path to each destination
network
use the DUAL FSM to select efficient, loop-free paths, and insert routes into the routing
table

5.




Refer to the exhibit. When Router D is configured to use a link-state routing
protocol and is added to the network, what is the first thing that it does to begin
learning the network topology?
It sends LSP packets to Routers B and C.
It sends LSP packets to all routers in the network.
It sends Hello packets to all routers in the network.
It sends information about its directly connected neighbors to Routers A and E.
It sends information about its directly connected neighbors to all routers in the network.
It learns about its directly connected networks when its interfaces reach the up state.

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

7. 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
www.ccnafinal.net www.ccnafinalexam.com www.ccnaanswers.org www.ccna4u.net
                      www.ccna4u.org www.ccna4u.info

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

9.




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

10. What two statements correctly describe the link state routing process? (Choose
two.)
each router in the area floods LSPs to all neighbors
all routers in the area have identical link state databases
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

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

12.
www.ccnafinal.net www.ccnafinalexam.com www.ccnaanswers.org www.ccna4u.net
                      www.ccna4u.org www.ccna4u.info




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

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

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

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

16. What are some of the 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.
Frequent periodic updates are sent to minimize the number of incorrect routes in the
topological database.
www.ccnafinal.net www.ccnafinalexam.com www.ccnaanswers.org www.ccna4u.net
                      www.ccna4u.org www.ccna4u.info

Routers have direct knowledge of all links in the network and how they are connected.
After the inital LSA flooding, they generally require less bandwidth to communicate
changes in a topology.
Link-state protocols require less router processor power than distance vector protocols.

17.




Refer to the exhibit. If all routers and interfaces are configured to use a link-state
routing protocol, from which routers will router D receive hello packets?
A and E
B and C
A, B, C, and E
C only

18. Which two routing protocols use Dijkstra’s shortest path first algorithm?
(Choose two.)
RIPv1
RIPv2
IS-IS
BGP
EIGRP
OSPF

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

20. 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.
www.ccnafinal.net www.ccnafinalexam.com www.ccnaanswers.org www.ccna4u.net
                      www.ccna4u.org www.ccna4u.info

After the inital LSP flooding, they generally require less bandwidth to communicate
changes in a topology.
Frequent periodic updates are sent to minimize the number of incorrect routes in the
topological database.

21. To achieve network convergence, what three steps does each link state router
take? (Choose three.)
use automatic summarization to reduce the size of routing tables
build a Link State Packet (LSP) containing the state of each directly connected link
flood the LSP to all neighbors, who then store all LSPs received in a database
send hello packages at regular intervals to discover neighbors and establish adjacencies
construct a complete map of the topology and compute the best path to each destination
network
use the DUAL FSM to select efficient, loop-free paths, and insert routes into the routing
table

Taged:
Why is it difficult for routing loops to occur in networks that use link-state routing

Related Posts

   •   CCNA 2 Skill test 2011
   •   CCNA 2 Chapter 11 V4.0 Answers
   •   CCNA 2 Chapter 9 V4.0 Answers
   •   CCNA 2 Chapter 8 V4.0 Answers
   •   CCNA 2 Chapter 7 V4.0 Answers
   •   CCNA 2 Chapter 6 V4.0 Answers
   •   CCNA 2 Chapter 5 V4.0 Answers
   •   CCNA 2 Chapter 4 V4.0 Answers
   •   CCNA 2 Chapter 3 V4.0 Answers
   •   CCNA 2 Chapter 2 V4.0 Answers
   •   CCNA 2 Chapter 1 V4.0 Answers
   •   CCNA 2 Final Exam Answers

Tags: CCNA 2, CCNA 2 Final, ccna 2 final answers, CCNA 2 Final Exam, ccna 2 final
exam 2011, CCNA 2 Final Exam Answers, ccna 2 final exams, ccna 2 final questions,
ccna final exam 2011
← CCNA 1 Final Exam Answers CCNA 3 Final Exam Answers (2010) →

Leave a Reply

More Related Content

What's hot

Routing table
Routing tableRouting table
Routing table
obadahamdan
 
Group 1
Group 1Group 1
Group 1
lifetobeart
 
Olsr protocol ppt
Olsr protocol pptOlsr protocol ppt
Olsr protocol ppt
sharat sajjan
 
Rajesh basics of networking and routing
Rajesh basics of networking and routingRajesh basics of networking and routing
Rajesh basics of networking and routing
r123027
 
IP ROUTING
IP ROUTINGIP ROUTING
IP ROUTING
anilinvns
 
Ccna 2 chapter 3 v4.0 answers 2011
Ccna 2 chapter 3 v4.0 answers 2011Ccna 2 chapter 3 v4.0 answers 2011
Ccna 2 chapter 3 v4.0 answers 2011
Dân Chơi
 
Distance vector and link state routing protocol
Distance vector and link state routing protocolDistance vector and link state routing protocol
Distance vector and link state routing protocol
CCNAStudyGuide
 
Routing
RoutingRouting
Routing
Saima Azam
 
Dynamic Routing
Dynamic RoutingDynamic Routing
Dynamic Routing
tmavroidis
 
Design and Implementation of Dynamic Routing in Wireless Networks
Design and Implementation of Dynamic Routing in Wireless NetworksDesign and Implementation of Dynamic Routing in Wireless Networks
Design and Implementation of Dynamic Routing in Wireless Networks
Satish Reddy
 
Ospf
OspfOspf
network convergence problem and solutions
network convergence  problem and solutionsnetwork convergence  problem and solutions
network convergence problem and solutions
Siddhi Viradiya
 
EIGRP Overview
EIGRP OverviewEIGRP Overview
EIGRP Overview
NetProtocol Xpert
 
EIGRP Configuration
EIGRP ConfigurationEIGRP Configuration
EIGRP Configuration
NetProtocol Xpert
 
Cisco discovery drs ent module 10 - v.4 in english.
Cisco discovery   drs ent module 10 - v.4 in english.Cisco discovery   drs ent module 10 - v.4 in english.
Cisco discovery drs ent module 10 - v.4 in english.
igede tirtanata
 
Layer 2 switching loop
Layer 2 switching loopLayer 2 switching loop
Layer 2 switching loop
NetProtocol Xpert
 
OSPF Overview
OSPF OverviewOSPF Overview
OSPF Overview
NetProtocol Xpert
 
Routing Techniques
Routing TechniquesRouting Techniques
Routing Techniques
Nishant Munjal
 
Layer 3
Layer 3Layer 3
Layer 3
aaa10425
 
Routing Protocols
Routing ProtocolsRouting Protocols

What's hot (20)

Routing table
Routing tableRouting table
Routing table
 
Group 1
Group 1Group 1
Group 1
 
Olsr protocol ppt
Olsr protocol pptOlsr protocol ppt
Olsr protocol ppt
 
Rajesh basics of networking and routing
Rajesh basics of networking and routingRajesh basics of networking and routing
Rajesh basics of networking and routing
 
IP ROUTING
IP ROUTINGIP ROUTING
IP ROUTING
 
Ccna 2 chapter 3 v4.0 answers 2011
Ccna 2 chapter 3 v4.0 answers 2011Ccna 2 chapter 3 v4.0 answers 2011
Ccna 2 chapter 3 v4.0 answers 2011
 
Distance vector and link state routing protocol
Distance vector and link state routing protocolDistance vector and link state routing protocol
Distance vector and link state routing protocol
 
Routing
RoutingRouting
Routing
 
Dynamic Routing
Dynamic RoutingDynamic Routing
Dynamic Routing
 
Design and Implementation of Dynamic Routing in Wireless Networks
Design and Implementation of Dynamic Routing in Wireless NetworksDesign and Implementation of Dynamic Routing in Wireless Networks
Design and Implementation of Dynamic Routing in Wireless Networks
 
Ospf
OspfOspf
Ospf
 
network convergence problem and solutions
network convergence  problem and solutionsnetwork convergence  problem and solutions
network convergence problem and solutions
 
EIGRP Overview
EIGRP OverviewEIGRP Overview
EIGRP Overview
 
EIGRP Configuration
EIGRP ConfigurationEIGRP Configuration
EIGRP Configuration
 
Cisco discovery drs ent module 10 - v.4 in english.
Cisco discovery   drs ent module 10 - v.4 in english.Cisco discovery   drs ent module 10 - v.4 in english.
Cisco discovery drs ent module 10 - v.4 in english.
 
Layer 2 switching loop
Layer 2 switching loopLayer 2 switching loop
Layer 2 switching loop
 
OSPF Overview
OSPF OverviewOSPF Overview
OSPF Overview
 
Routing Techniques
Routing TechniquesRouting Techniques
Routing Techniques
 
Layer 3
Layer 3Layer 3
Layer 3
 
Routing Protocols
Routing ProtocolsRouting Protocols
Routing Protocols
 

Similar to Ccna 2 chapter 10 v4.0 answers 2011

Cisco discovery drs ent module 6 - v.4 in english.
Cisco discovery   drs ent module 6 - v.4 in english.Cisco discovery   drs ent module 6 - v.4 in english.
Cisco discovery drs ent module 6 - v.4 in english.
igede tirtanata
 
3 ip routing eigrp
3 ip routing eigrp3 ip routing eigrp
3 ip routing eigrp
SagarR24
 
CSC427_Week_11.pdf
CSC427_Week_11.pdfCSC427_Week_11.pdf
CSC427_Week_11.pdf
muazumuhammad6
 
ccna-discowey-final-100
 ccna-discowey-final-100 ccna-discowey-final-100
ccna-discowey-final-100
junkut3
 
3 ip routing part b
3 ip routing part b3 ip routing part b
3 ip routing part b
SagarR24
 
3 ip routing bgp-updated
3 ip routing bgp-updated3 ip routing bgp-updated
3 ip routing bgp-updated
SagarR24
 
ivesgimpaya2
ivesgimpaya2ivesgimpaya2
ivesgimpaya2
guest10184a
 
Day 8 1 introducing routing n
Day 8 1 introducing routing nDay 8 1 introducing routing n
Day 8 1 introducing routing n
CYBERINTELLIGENTS
 
Routing
RoutingRouting
IPv6 Routing.pdf
IPv6 Routing.pdfIPv6 Routing.pdf
IPv6 Routing.pdf
niran10
 
All in one q & ans
All in one q & ansAll in one q & ans
All in one q & ans
Ravi Kodoli
 
E routing final exam ccna 2 46
E routing final exam ccna 2 46E routing final exam ccna 2 46
E routing final exam ccna 2 46
lslsc
 
Ccna 2 v 4.0 final-exam-19-06-2010
Ccna 2 v 4.0 final-exam-19-06-2010Ccna 2 v 4.0 final-exam-19-06-2010
Ccna 2 v 4.0 final-exam-19-06-2010
irbas
 
Ccna 2 v 4.0 final-exam-19-06-2010
Ccna 2 v 4.0 final-exam-19-06-2010Ccna 2 v 4.0 final-exam-19-06-2010
Ccna 2 v 4.0 final-exam-19-06-2010
irbas
 
Ccna 2 chapter 9 v4.0 answers 2011
Ccna 2 chapter 9 v4.0 answers 2011Ccna 2 chapter 9 v4.0 answers 2011
Ccna 2 chapter 9 v4.0 answers 2011
Dân Chơi
 
CCNA3 Verson6 Chapter5
CCNA3 Verson6 Chapter5CCNA3 Verson6 Chapter5
CCNA3 Verson6 Chapter5
Chaing Ravuth
 
Ccna 3 chapter 5 v4.0 answers 2011
Ccna 3 chapter 5 v4.0 answers 2011Ccna 3 chapter 5 v4.0 answers 2011
Ccna 3 chapter 5 v4.0 answers 2011
Dân Chơi
 
ivesgimpaya3
ivesgimpaya3ivesgimpaya3
ivesgimpaya3
guest10184a
 
Ccna 3-discovery-4-0-module-6-100-
Ccna 3-discovery-4-0-module-6-100-Ccna 3-discovery-4-0-module-6-100-
Ccna 3-discovery-4-0-module-6-100-
junkut3
 
Arun project-Final
Arun project-FinalArun project-Final

Similar to Ccna 2 chapter 10 v4.0 answers 2011 (20)

Cisco discovery drs ent module 6 - v.4 in english.
Cisco discovery   drs ent module 6 - v.4 in english.Cisco discovery   drs ent module 6 - v.4 in english.
Cisco discovery drs ent module 6 - v.4 in english.
 
3 ip routing eigrp
3 ip routing eigrp3 ip routing eigrp
3 ip routing eigrp
 
CSC427_Week_11.pdf
CSC427_Week_11.pdfCSC427_Week_11.pdf
CSC427_Week_11.pdf
 
ccna-discowey-final-100
 ccna-discowey-final-100 ccna-discowey-final-100
ccna-discowey-final-100
 
3 ip routing part b
3 ip routing part b3 ip routing part b
3 ip routing part b
 
3 ip routing bgp-updated
3 ip routing bgp-updated3 ip routing bgp-updated
3 ip routing bgp-updated
 
ivesgimpaya2
ivesgimpaya2ivesgimpaya2
ivesgimpaya2
 
Day 8 1 introducing routing n
Day 8 1 introducing routing nDay 8 1 introducing routing n
Day 8 1 introducing routing n
 
Routing
RoutingRouting
Routing
 
IPv6 Routing.pdf
IPv6 Routing.pdfIPv6 Routing.pdf
IPv6 Routing.pdf
 
All in one q & ans
All in one q & ansAll in one q & ans
All in one q & ans
 
E routing final exam ccna 2 46
E routing final exam ccna 2 46E routing final exam ccna 2 46
E routing final exam ccna 2 46
 
Ccna 2 v 4.0 final-exam-19-06-2010
Ccna 2 v 4.0 final-exam-19-06-2010Ccna 2 v 4.0 final-exam-19-06-2010
Ccna 2 v 4.0 final-exam-19-06-2010
 
Ccna 2 v 4.0 final-exam-19-06-2010
Ccna 2 v 4.0 final-exam-19-06-2010Ccna 2 v 4.0 final-exam-19-06-2010
Ccna 2 v 4.0 final-exam-19-06-2010
 
Ccna 2 chapter 9 v4.0 answers 2011
Ccna 2 chapter 9 v4.0 answers 2011Ccna 2 chapter 9 v4.0 answers 2011
Ccna 2 chapter 9 v4.0 answers 2011
 
CCNA3 Verson6 Chapter5
CCNA3 Verson6 Chapter5CCNA3 Verson6 Chapter5
CCNA3 Verson6 Chapter5
 
Ccna 3 chapter 5 v4.0 answers 2011
Ccna 3 chapter 5 v4.0 answers 2011Ccna 3 chapter 5 v4.0 answers 2011
Ccna 3 chapter 5 v4.0 answers 2011
 
ivesgimpaya3
ivesgimpaya3ivesgimpaya3
ivesgimpaya3
 
Ccna 3-discovery-4-0-module-6-100-
Ccna 3-discovery-4-0-module-6-100-Ccna 3-discovery-4-0-module-6-100-
Ccna 3-discovery-4-0-module-6-100-
 
Arun project-Final
Arun project-FinalArun project-Final
Arun project-Final
 

More from Dân Chơi

Chương 1
Chương 1Chương 1
Chương 1
Dân Chơi
 
Ccna 4 chapter 6 v4.0 answers 2011
Ccna 4 chapter 6 v4.0 answers 2011Ccna 4 chapter 6 v4.0 answers 2011
Ccna 4 chapter 6 v4.0 answers 2011
Dân Chơi
 
Ccna 4 chapter 2 v4.0 answers 2011
Ccna 4 chapter 2 v4.0 answers 2011Ccna 4 chapter 2 v4.0 answers 2011
Ccna 4 chapter 2 v4.0 answers 2011
Dân Chơi
 
Ccna 4 chapter 1 v4.0 answers 2011
Ccna 4 chapter 1 v4.0 answers 2011Ccna 4 chapter 1 v4.0 answers 2011
Ccna 4 chapter 1 v4.0 answers 2011
Dân Chơi
 
Ccna 3 chapter 7 v4.0 answers 2011
Ccna 3 chapter 7 v4.0 answers 2011Ccna 3 chapter 7 v4.0 answers 2011
Ccna 3 chapter 7 v4.0 answers 2011
Dân Chơi
 
Ccna 2 chapter 11 v4.0 answers 2011
Ccna 2 chapter 11 v4.0 answers 2011Ccna 2 chapter 11 v4.0 answers 2011
Ccna 2 chapter 11 v4.0 answers 2011
Dân Chơi
 
Ccna 1 chapter 11 v4.0 answers 2011
Ccna 1 chapter 11 v4.0 answers 2011Ccna 1 chapter 11 v4.0 answers 2011
Ccna 1 chapter 11 v4.0 answers 2011
Dân Chơi
 
Ccna 1 chapter 7 v4.0 answers 2011
Ccna 1 chapter 7 v4.0 answers 2011Ccna 1 chapter 7 v4.0 answers 2011
Ccna 1 chapter 7 v4.0 answers 2011
Dân Chơi
 
Ccna 1 chapter 6 v4.0 answers 2011
Ccna 1 chapter 6 v4.0 answers 2011Ccna 1 chapter 6 v4.0 answers 2011
Ccna 1 chapter 6 v4.0 answers 2011
Dân Chơi
 
Ccna 1 chapter 5 v4.0 answers 2011
Ccna 1 chapter 5 v4.0 answers 2011Ccna 1 chapter 5 v4.0 answers 2011
Ccna 1 chapter 5 v4.0 answers 2011
Dân Chơi
 
Ccna 2 chapter 2 v4.0 answers 2011
Ccna 2 chapter 2 v4.0 answers 2011Ccna 2 chapter 2 v4.0 answers 2011
Ccna 2 chapter 2 v4.0 answers 2011
Dân Chơi
 
Ccna 2 chapter 5 v4.0 answers 2011
Ccna 2 chapter 5 v4.0 answers 2011Ccna 2 chapter 5 v4.0 answers 2011
Ccna 2 chapter 5 v4.0 answers 2011
Dân Chơi
 
Ccna 3 chapter 2 v4.0 answers 2011
Ccna 3 chapter 2 v4.0 answers 2011Ccna 3 chapter 2 v4.0 answers 2011
Ccna 3 chapter 2 v4.0 answers 2011
Dân Chơi
 
Ccna 3 chapter 4 v4.0 answers 2011
Ccna 3 chapter 4 v4.0 answers 2011Ccna 3 chapter 4 v4.0 answers 2011
Ccna 3 chapter 4 v4.0 answers 2011
Dân Chơi
 
Ccna 4 chapter 8 v4.0 answers 2011
Ccna 4 chapter 8 v4.0 answers 2011Ccna 4 chapter 8 v4.0 answers 2011
Ccna 4 chapter 8 v4.0 answers 2011
Dân Chơi
 
Ccna 3 chapter 3 v4.0 answers 2011
Ccna 3 chapter 3 v4.0 answers 2011Ccna 3 chapter 3 v4.0 answers 2011
Ccna 3 chapter 3 v4.0 answers 2011
Dân Chơi
 
Ccna 3 chapter 6 v4.0 answers 2011
Ccna 3 chapter 6 v4.0 answers 2011Ccna 3 chapter 6 v4.0 answers 2011
Ccna 3 chapter 6 v4.0 answers 2011
Dân Chơi
 
Ccna 2 chapter 8 v4.0 answers 2011
Ccna 2 chapter 8 v4.0 answers 2011Ccna 2 chapter 8 v4.0 answers 2011
Ccna 2 chapter 8 v4.0 answers 2011
Dân Chơi
 
Ccna 2 chapter 7 v4.0 answers 2011
Ccna 2 chapter 7 v4.0 answers 2011Ccna 2 chapter 7 v4.0 answers 2011
Ccna 2 chapter 7 v4.0 answers 2011
Dân Chơi
 
Ccna 1 chapter 8 v4.0 answers 2011
Ccna 1 chapter 8 v4.0 answers 2011Ccna 1 chapter 8 v4.0 answers 2011
Ccna 1 chapter 8 v4.0 answers 2011
Dân Chơi
 

More from Dân Chơi (20)

Chương 1
Chương 1Chương 1
Chương 1
 
Ccna 4 chapter 6 v4.0 answers 2011
Ccna 4 chapter 6 v4.0 answers 2011Ccna 4 chapter 6 v4.0 answers 2011
Ccna 4 chapter 6 v4.0 answers 2011
 
Ccna 4 chapter 2 v4.0 answers 2011
Ccna 4 chapter 2 v4.0 answers 2011Ccna 4 chapter 2 v4.0 answers 2011
Ccna 4 chapter 2 v4.0 answers 2011
 
Ccna 4 chapter 1 v4.0 answers 2011
Ccna 4 chapter 1 v4.0 answers 2011Ccna 4 chapter 1 v4.0 answers 2011
Ccna 4 chapter 1 v4.0 answers 2011
 
Ccna 3 chapter 7 v4.0 answers 2011
Ccna 3 chapter 7 v4.0 answers 2011Ccna 3 chapter 7 v4.0 answers 2011
Ccna 3 chapter 7 v4.0 answers 2011
 
Ccna 2 chapter 11 v4.0 answers 2011
Ccna 2 chapter 11 v4.0 answers 2011Ccna 2 chapter 11 v4.0 answers 2011
Ccna 2 chapter 11 v4.0 answers 2011
 
Ccna 1 chapter 11 v4.0 answers 2011
Ccna 1 chapter 11 v4.0 answers 2011Ccna 1 chapter 11 v4.0 answers 2011
Ccna 1 chapter 11 v4.0 answers 2011
 
Ccna 1 chapter 7 v4.0 answers 2011
Ccna 1 chapter 7 v4.0 answers 2011Ccna 1 chapter 7 v4.0 answers 2011
Ccna 1 chapter 7 v4.0 answers 2011
 
Ccna 1 chapter 6 v4.0 answers 2011
Ccna 1 chapter 6 v4.0 answers 2011Ccna 1 chapter 6 v4.0 answers 2011
Ccna 1 chapter 6 v4.0 answers 2011
 
Ccna 1 chapter 5 v4.0 answers 2011
Ccna 1 chapter 5 v4.0 answers 2011Ccna 1 chapter 5 v4.0 answers 2011
Ccna 1 chapter 5 v4.0 answers 2011
 
Ccna 2 chapter 2 v4.0 answers 2011
Ccna 2 chapter 2 v4.0 answers 2011Ccna 2 chapter 2 v4.0 answers 2011
Ccna 2 chapter 2 v4.0 answers 2011
 
Ccna 2 chapter 5 v4.0 answers 2011
Ccna 2 chapter 5 v4.0 answers 2011Ccna 2 chapter 5 v4.0 answers 2011
Ccna 2 chapter 5 v4.0 answers 2011
 
Ccna 3 chapter 2 v4.0 answers 2011
Ccna 3 chapter 2 v4.0 answers 2011Ccna 3 chapter 2 v4.0 answers 2011
Ccna 3 chapter 2 v4.0 answers 2011
 
Ccna 3 chapter 4 v4.0 answers 2011
Ccna 3 chapter 4 v4.0 answers 2011Ccna 3 chapter 4 v4.0 answers 2011
Ccna 3 chapter 4 v4.0 answers 2011
 
Ccna 4 chapter 8 v4.0 answers 2011
Ccna 4 chapter 8 v4.0 answers 2011Ccna 4 chapter 8 v4.0 answers 2011
Ccna 4 chapter 8 v4.0 answers 2011
 
Ccna 3 chapter 3 v4.0 answers 2011
Ccna 3 chapter 3 v4.0 answers 2011Ccna 3 chapter 3 v4.0 answers 2011
Ccna 3 chapter 3 v4.0 answers 2011
 
Ccna 3 chapter 6 v4.0 answers 2011
Ccna 3 chapter 6 v4.0 answers 2011Ccna 3 chapter 6 v4.0 answers 2011
Ccna 3 chapter 6 v4.0 answers 2011
 
Ccna 2 chapter 8 v4.0 answers 2011
Ccna 2 chapter 8 v4.0 answers 2011Ccna 2 chapter 8 v4.0 answers 2011
Ccna 2 chapter 8 v4.0 answers 2011
 
Ccna 2 chapter 7 v4.0 answers 2011
Ccna 2 chapter 7 v4.0 answers 2011Ccna 2 chapter 7 v4.0 answers 2011
Ccna 2 chapter 7 v4.0 answers 2011
 
Ccna 1 chapter 8 v4.0 answers 2011
Ccna 1 chapter 8 v4.0 answers 2011Ccna 1 chapter 8 v4.0 answers 2011
Ccna 1 chapter 8 v4.0 answers 2011
 

Ccna 2 chapter 10 v4.0 answers 2011

  • 1. www.ccnafinal.net www.ccnafinalexam.com www.ccnaanswers.org www.ccna4u.net www.ccna4u.org www.ccna4u.info CCNA 2 Chapter 10 V4.0 Answers 1. 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 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. 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 4. To achieve network convergence, what three steps does each link state router take? (Choose three.) use automatic summarization to reduce the size of routing tables build a Link State Packet (LSP) containing the state of each directly connected link flood the LSP to all neighbors, who then store all LSPs received in a database
  • 2. www.ccnafinal.net www.ccnafinalexam.com www.ccnaanswers.org www.ccna4u.net www.ccna4u.org www.ccna4u.info discover neighbors and establish adjacencies using the hello packet sent at regular intervals construct a complete map of the topology and compute the best path to each destination network use the DUAL FSM to select efficient, loop-free paths, and insert routes into the routing table 5. Refer to the exhibit. When Router D is configured to use a link-state routing protocol and is added to the network, what is the first thing that it does to begin learning the network topology? It sends LSP packets to Routers B and C. It sends LSP packets to all routers in the network. It sends Hello packets to all routers in the network. It sends information about its directly connected neighbors to Routers A and E. It sends information about its directly connected neighbors to all routers in the network. It learns about its directly connected networks when its interfaces reach the up state. 6. 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 7. 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
  • 3. www.ccnafinal.net www.ccnafinalexam.com www.ccnaanswers.org www.ccna4u.net www.ccna4u.org www.ccna4u.info 8. 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 9. 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 10. What two statements correctly describe the link state routing process? (Choose two.) each router in the area floods LSPs to all neighbors all routers in the area have identical link state databases 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 11. 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 12.
  • 4. www.ccnafinal.net www.ccnafinalexam.com www.ccnaanswers.org www.ccna4u.net www.ccna4u.org www.ccna4u.info 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 13. 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 14. 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 15. Which algorithm is run by link-state routing protocols to calculate the shortest path to destination networks? DUAL Dijkstra Bellman-Ford Diffie-Hellman 16. What are some of the 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. Frequent periodic updates are sent to minimize the number of incorrect routes in the topological database.
  • 5. www.ccnafinal.net www.ccnafinalexam.com www.ccnaanswers.org www.ccna4u.net www.ccna4u.org www.ccna4u.info Routers have direct knowledge of all links in the network and how they are connected. After the inital LSA flooding, they generally require less bandwidth to communicate changes in a topology. Link-state protocols require less router processor power than distance vector protocols. 17. Refer to the exhibit. If all routers and interfaces are configured to use a link-state routing protocol, from which routers will router D receive hello packets? A and E B and C A, B, C, and E C only 18. Which two routing protocols use Dijkstra’s shortest path first algorithm? (Choose two.) RIPv1 RIPv2 IS-IS BGP EIGRP OSPF 19. 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 20. 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.
  • 6. www.ccnafinal.net www.ccnafinalexam.com www.ccnaanswers.org www.ccna4u.net www.ccna4u.org www.ccna4u.info After the inital LSP flooding, they generally require less bandwidth to communicate changes in a topology. Frequent periodic updates are sent to minimize the number of incorrect routes in the topological database. 21. To achieve network convergence, what three steps does each link state router take? (Choose three.) use automatic summarization to reduce the size of routing tables build a Link State Packet (LSP) containing the state of each directly connected link flood the LSP to all neighbors, who then store all LSPs received in a database send hello packages at regular intervals to discover neighbors and establish adjacencies construct a complete map of the topology and compute the best path to each destination network use the DUAL FSM to select efficient, loop-free paths, and insert routes into the routing table Taged: Why is it difficult for routing loops to occur in networks that use link-state routing Related Posts • CCNA 2 Skill test 2011 • CCNA 2 Chapter 11 V4.0 Answers • CCNA 2 Chapter 9 V4.0 Answers • CCNA 2 Chapter 8 V4.0 Answers • CCNA 2 Chapter 7 V4.0 Answers • CCNA 2 Chapter 6 V4.0 Answers • CCNA 2 Chapter 5 V4.0 Answers • CCNA 2 Chapter 4 V4.0 Answers • CCNA 2 Chapter 3 V4.0 Answers • CCNA 2 Chapter 2 V4.0 Answers • CCNA 2 Chapter 1 V4.0 Answers • CCNA 2 Final Exam Answers Tags: CCNA 2, CCNA 2 Final, ccna 2 final answers, CCNA 2 Final Exam, ccna 2 final exam 2011, CCNA 2 Final Exam Answers, ccna 2 final exams, ccna 2 final questions, ccna final exam 2011 ← CCNA 1 Final Exam Answers CCNA 3 Final Exam Answers (2010) → Leave a Reply