CCNA2 Chapter 10 Practice Test Answers

Which are the first networks to be put in the routing table?

Directly connected networks.
Networks learned using OSPF
Networks learned using EIGRP
Networks learned using RIP
What needs to be true of a link before that link is included in link state
updates? !"hoose all that appl#$
The link must have an IP address configured.
The link must be up.
%he link &ust be a serial link
The link must have its network included in a network command.
Which routing algorith& is used b# link state routing protocols?
'()*
SPF
*S(
+ell&an,Ford
When does a link state routing protocol &ake &ost use of bandwidth?
!"hoose -$
It uses a si&ilar a&ount all the ti&e
E.er# /0 seconds
When the routers first start up.
When the topology changes.
Where does a link state router send link state packets?
%o all directl# connected de.ices
%o all routers in the area that are running the sa&e routing protocol
%o one central router in the area
To all neighbours with which it has become adacent.
When does a link state router send hello packets?
When there is a topolog# change
!t regular intervals to maintain a keepalive.
When a neighbour sends a re1uest
%o notif# that a regular update is due
SW -/2302-004 2.ar2www2apps2con.ersion2t&p2scratch562--66/0734doc 3
Which will be the sa&e for all routers in an OSPF area that has con.erged?
%he routing table
The link state database
%he neighbour table
%he best paths to each destination
What infor&ation is included in a link state packet? !"hoose all that appl#$
!ddress and mask of network for the link
"etric for the link
)ddress of final destination network
Nu&ber of hops to destination
#ostname of neighbour on the link
Type of link e.g. Serial$ %thernet
Wh# is it an ad.antage for a link state protocol to ha.e a hierarchical design?
It allows routers &ade b# different &anufacturers to be used
It cuts down processing time and use of bandwidth.
It allows all routers to beco&e ad8acent to each other
It allows a &ore efficient &etric to be used
Which is true of a link state routing protocol?
Each router should ha.e the sa&e infor&ation in its routing table when
the network has con.erged
Each router uses the best route &etric supplied b# its neighbour to
calculate backup routes
%ach router calculates its own best routes using the information
in its link state database.
Each router passes on its best route calculations to its neighbour to
sa.e on processing effort
9ow does a link state routing protocol differ fro& EIGRP?
It uses hello packets to for& ad8acencies with neighbours
It sends updates when the topolog# changes
It is fast to con.erge
It holds information about the whole topology of the routing area.
SW -/2302-004 2.ar2www2apps2con.ersion2t&p2scratch562--66/0734doc -
9ow do link state protocols &anage to a.oid routing loops?
%he# use the split hori:on rule so that the# do not send infor&ation out
of an interface that has recei.ed it
They hold a complete picture of the topology so that the routing
algorithm should not produce any routes containing loops.
%he# use holddown ti&ers so that the# wait before passing on the
infor&ation that a link &a# be down
%he# use count to infinit# b# restricting the nu&ber of hops to a
network
Which are ad.antages of using a link state routing protocol rather than a
distance .ector routing protocol such as RIP? !"hoose -$
&ink state routing protocols give fast convergence.
*ink state routing protocols &ake lower de&ands on router processing
power
*ink state routing protocols send regular co&plete updates so that the
infor&ation is alwa#s correct
&ink state routing protocols tend to use less bandwidth after the
initial flooding phase.
What is the 'i8kstra algorith&?
)nother na&e for the +ell&an,Ford algorith&
)nother na&e for the '()* algorith&
!nother name for the SPF algorithm.
)nother na&e for the S%P algorith&
Which is true of OSPF;s &etric in the "isco i&ple&entation?
The metric is cost$ which is calculated so that the highest
bandwidth links have the lowest cost.
%he &etric is cost< which is calculated using the nu&ber of hops
%he &etric is cost< which is calculated according to the charge that the
ISP &akes for the link
%he &etric is cost< which is calculated using bandwidth and dela# b#
default< though load and reliabilit# can also be used
When a link goes down< how long does a router running a link state protocol
wait before sending an update to its neighbours?
/0 seconds
70 seconds
/0 &inutes
It sends the update at once.
SW -/2302-004 2.ar2www2apps2con.ersion2t&p2scratch562--66/0734doc /
What does a link state router do to a link state packet after recei.ing it and
before forwarding it to a neighbour?
It updates the &etric b# 3
It recalculates the best routes and updates the packet
'othing. It forwards the packet as it is.
It does not forward packets that it recei.es
Where would OSPF be a good choice of routing protocol but EIGRP would
not?
On a network where the routers are old and ha.e little processing
power
(n a network where non)*isco routers may be used.
On a network where subnetting uses =*S>
On a network where fast con.ergence is essential
SW -/2302-004 2.ar2www2apps2con.ersion2t&p2scratch562--66/0734doc ?