CCNA 3 (v5.0.3 + v6.0) Chapter 5 Exam Answers 2020

[ad_1]

Easy methods to discover: Press “Ctrl + F” within the browser and fill in no matter wording is within the query to seek out that query/reply. If the query is just not right here, discover it in Questions Financial institution.

NOTE: When you’ve got the brand new query on this take a look at, please remark Query and A number of-Selection listing in type beneath this text. We are going to replace solutions for you within the shortest time. Thanks! We really worth your contribution to the web site.

1. Which routing protocol is designed to make use of areas to scale massive hierarchical networks?

OSPF works finest for a big hierarchical community, as a result of OSPF helps a multiarea design, which offers a a lot better scaling functionality in contrast with EIGRP

2. Which routing protocol makes use of link-state data to construct a map of the topology for computing one of the best path to every vacation spot community?

OSPF is a link-state routing protocol and as such it makes use of a link-state database to assemble a topology map of the community to calculate one of the best path to vacation spot networks. RIP, RIPng, and EIGRP are distance vector routing protocols.

3. After a community topology change happens, which distance vector routing protocol can ship an replace message on to a single neighboring router with out unnecessarily notifying different routers?

IS-IS
RIPv1
RIPv2
EIGRP*
OSPF

RIPv2 and EIGRP help updating neighboring routers by way of using multicasting. EIGRP is the one distance vector protocol that may help updating a particular neighbor through the use of unicast. OSPF and ISIS are hyperlink state protocols.

4. Which dynamic routing protocol was developed as an exterior gateway protocol to interconnect totally different Web suppliers?

BGP is a protocol developed to interconnect totally different ranges of ISPs in addition to ISPs and a few of their bigger non-public shoppers.

5. A community administrator is researching routing protocols for implementation in a essential community infrastructure. Which protocol makes use of the DUAL algorithm to offer nearly instantaneous convergence throughout a route failover?

EIGRP is usually the quickest IGP to converge as a result of it maintains alternate routes. A switchover to an alternate route is instant and doesn’t contain interplay with different routers.

6. Which routing protocol sends a routing replace to neighboring routers each 30 seconds?

No matter topology modifications, RIP sends a periodic replace to all neighboring routers each 30 seconds.

7. Which assertion is an incorrect description of the OSPF protocol?

Multiarea OSPF helps cut back the dimensions of the link-state database.
In comparison with distance vector routing protocols, OSPF makes use of much less reminiscence and fewer CPU processing energy.*
OSPF builds a topological map of the community.
OSPF has quick convergence.

Hyperlink-state protocols require extra reminiscence to create and keep the link-state database.

8. What occurs when two link-state routers cease receiving hi there packets from neighbors?

They create a default path to the adjoining router.
They proceed to function as regular and are in a position to trade packets.
They think about the neighbor to be unreachable and the adjacency is damaged.*
They’ll flood their database tables to one another.

Hiya packets serve a keepalive perform to observe the state of an adjoining router.

9. What are two options of the OSPF routing protocol? (Select two.)

has an administrative distance of 100used primarily as an EGP
makes use of Dijkstra’s algorithm to construct the SPF tree*
mechanically summarizes networks on the classful boundaries
calculates its metric utilizing bandwidth*

Traits of OSPF embody the next:
Inside gateway protocol
Hyperlink-state
Classless
Price metric based mostly on bandwidth
Dijkstra algorithm
Builds topological map
Occasion-driven updates
Hierarchical design
Requires further reminiscence, CPU processing, and extra preliminary bandwidth than different protocols

10. What’s maintained inside an EIGRP topology desk?

the hop rely to all networks
all routes acquired from neighbors*
the realm ID of all neighbors
the state of all hyperlinks on the community

The EIGRP topology desk maintains all of the routes acquired from neighbors, not simply one of the best paths. DUAL can use backup routes from the topology desk to offer instantaneous route failover within the EIGRP routing desk.

11. What’s the distinction between inside and exterior routing protocols?

Inside routing protocols are used to route on the Web. Exterior routing protocols are used inside organizations.
Exterior routing protocols are used solely by massive ISPs. Inside routing protocols are utilized by small ISPs.
Exterior routing protocols are used to manage a single autonomous system. Inside routing protocols are used to manage a number of domains.
Inside routing protocols are used to speak inside a single autonomous system. Exterior routing protocols are used to speak between a number of autonomous programs.*

Inside gateway protocols (IGPs) are used for routing inside a company having a standard administration or autonomous system (AS). Exterior gateway protocols (EGPs) are utilized by service suppliers and typically by massive firms.

12. An OSPF enabled router is processing discovered routes to pick finest paths to succeed in a vacation spot community. What’s the OSPF algorithm evaluating because the metric?

The quantity of visitors and likelihood of failure of hyperlinks.
The quantity of packet supply time and slowest bandwidth.
The variety of hops alongside the routing path.
The cumulative bandwidth that’s used alongside the routing path.*

The OSPF routing protocol makes use of the cumulative bandwidth because the metric for route computations.

13. Seek advice from the exhibit. A community administrator has configured RIPv2 within the given topology. Which path would a packet take to get from the LAN that’s linked to R1 to the LAN that’s linked to R7?

R1–R3–R4–R5–R6–R7
R1–R4–R5–R6–R7
R1–R2–R6–R7*
R1–R3–R2–R6–R7

RIP makes use of hop rely to calculate one of the best path from supply to vacation spot.

14. Which two elements of an LSP allow an OSPF router to find out if the LSP that’s acquired incorporates newer data than what’s within the present OSPF router link-state database? (Select two.)

hellosquery
growing older data*
sequence numbers*
acknowledgements

Data similar to sequence numbers and growing older data is included in an LSP to assist handle the flooding course of. This data can help a router in figuring out if it has already acquired the LSP from one other router or if the LSP has newer data than what’s already contained within the link-state database.

15. What are two functions of dynamic routing protocols? (Select two.)

uncover distant networks*
present community safety
cut back community visitors
present a default path to community hosts
choose finest path to vacation spot networks*

The aim of dynamic routing protocols embody the next:
Uncover distant networks
Preserve up-to-date routing data
Select one of the best path to a vacation spot community
Discover a new finest path if the present path is just not out there

16. What is step one taken by a newly configured OSPF router within the strategy of reaching a state of convergence?

It floods LSP packets to neighboring routers.
It builds the topological database.
It learns about straight linked hyperlinks in an lively state.*
It exchanges hi there messages with a neighboring router.

Earlier than OSPF can type a neighbor adjacency and begin the Hiya protocol, it detects which interfaces are in an up and lively state.

17. Seek advice from the exhibit. OSPF is used within the community. Which path can be chosen by OSPF to ship information packets from Web A to Web B?

R1, R2, R5, R7
R1, R4, R6, R7
R1, R3, R5, R7*
R1, R3, R5, R6, R7
R1, R3, R6, R7

OSPF makes use of the shortest path first algorithm to pick one of the best path to ahead packets. Every path is labeled with a price for price and this algorithm accumulates prices alongside every path, from supply to vacation spot. The trail chosen from Web A to Web B is R1-R3-R5-R7, that is the same as 5+7+14+2=28, the shortest price.

18. Within the context of routing protocols, what’s a definition for time to convergence?

a measure of protocol configuration complexity
the period of time a community administrator must configure a routing protocol in a small- to medium-sized community
the period of time for the routing tables to attain a constant state after a topology change*
the potential to move information, video, and voice over the identical media

Time to convergence defines how rapidly the routers within the community topology share routing data and attain a state of constant information.

19. Which two necessities are vital earlier than a router configured with a link-state routing protocol can construct and ship its link-state packets? (Select two.)

The router has constructed an SPF tree.
The router has decided the prices related to its lively hyperlinks.*
The router has established its adjacencies.*
The router has constructed its link-state database.
The routing desk has been refreshed.

As soon as a router has established its adjacencies, it could actually construct its link-state packets (LSPs) that include the link-state data, together with the hyperlink price. A router can solely construct a link-state after it has acquired link-state packets from adjoining routers. It then constructs its SPF tree from the least price routes to distant networks that are used to populate its routing desk.

20. Which two routing protocols are categorised as distance vector routing protocols? (Select two.)

RIP and EIGRP are categorised as distance vector routing protocols, OSPF and IS-IS are categorised as link-state, and BGP is classed as a path-vector routing protocol.

21. Which two occasions will set off the sending of a link-state packet by a link-state routing protocol? (Select two.)

the router replace timer expiring
the requirement to periodically flood link-state packets to all neighbors
a change within the topology*
the preliminary startup of the routing protocol course of*
a hyperlink to a neighbor router has grow to be congested

An LSP (link-state packet) is just despatched throughout preliminary startup of the routing protocol course of on a router; and every time there’s a change within the topology, together with a hyperlink taking place or developing, or a neighbor adjacency being established or damaged. Information visitors congestion doesn’t straight affect routing protocol conduct. LSPs should not flooded periodically, and replace timers should not related to LSPs.

22. Which function offers safe routing updates between RIPv2 neighbors?

keepalive messages
routing protocol authentication*
adjacency desk
unicast updates

The RIPv2 routing protocol helps routing protocol authentication to safe routing desk updates between neighbors.

23. Which two protocols are link-state routing protocols? (Select two.)

OSPF*
EIGRP
RIP
IS-IS*
BGP
IGP

OSPF and IS-IS are link-state protocols. EIGRP and RIP are distance vector protocols.

24. What’s an obstacle of deploying OSPF in a big single space routing setting?

OSPF makes use of a topology database of alternate routes.
OSPF makes use of extreme LSP flooding.*
OSPF makes use of a metric of bandwidth and delay.
OSPF makes use of multicast updates.

Hyperlink-state protocols have the next disadvantages:
Reminiscence Necessities – Creating and sustaining the link-state database and SPF tree.
Processing Necessities – The SPF algorithm requires extra CPU time than distance vector algorithms as a result of link-state protocols construct an entire map of the topology.
Bandwidth Necessities – Hyperlink-state packet flooding can adversely have an effect on the out there bandwidth on a community.

25. Match the options of link-state routing protocols to their benefits and downsides. (Not all choices are used.)

Hyperlink-state routing protocols have their benefits and disadvantagea. The benefits are that every router builds a topological map; there may be quick convergence; and the LSPs are despatched solely when there’s a change in topology. The disadvantages are the necessities of router and bandwidth assets due to the complexity of the link-state routing protocols.

26. Which two items of data are utilized by the OSPF MD5 algorithm to generate a signature? (Select two.)

secret key*
OSPF message*
OSPF router ID
router hostname
interface IP tackle

Older Model

27. A community administrator has simply modified the router ID on a router that’s working in an OSPFv2 setting. What ought to the administrator do to reset the adjacencies and use the brand new router ID?

Configure the community statements.
Change the interface precedence.
Challenge the clear ip ospf course of privileged mode command.*
Change the OSPFv2 course of ID.

28. Seek advice from the exhibit. What three conclusions could be drawn from the displayed output? (Select three.)

The DR could be reached by the GigabitEthernet 0/0 interface.*
This interface is utilizing the default precedence.
The BDR has three neighbors.
The router ID on the DR router is 3.3.3.3
The router ID values weren’t the standards used to pick the DR and the BDR.*
There have been 9 seconds because the final hi there packet despatched.*

29. When checking a routing desk, a community technician notices the next entry:
O*E2 0.0.0.0/0 [110/1] by way of 192.168.16.3, 00:20:22, Serial0/0/0
What data could be gathered from this output?

This route is a propagated default route.*
The route is positioned two hops away.
The metric for this route is 110.
The sting of the OSPF space 0 is the interface that’s addressed 192.168.16.3.

30. Which command will a community engineer situation to confirm the configured hi there and useless timer intervals on a point-to-point WAN hyperlink between two routers which can be working OSPFv2?

present ip ospf neighbor
present ip ospf interface serial 0/0/0*
present ipv6 ospf interface serial 0/0/0
present ip ospf interface fastethernet 0/1

31. A community engineer has manually configured the hi there interval to fifteen seconds on an interface of a router that’s working OSPFv2. By default, how will the useless interval on the interface be affected?

The useless interval will now be 15 seconds.
The useless interval will now be 30 seconds.
The useless interval will now be 60 seconds.*
The useless interval won’t change from the default worth.

32. A community engineer suspects that OSPFv3 routers should not forming neighbor adjacencies as a result of there are interface timer mismatches. Which two instructions could be issued on the interface of every OSFPv3 router to resolve all timer mismatches? (Select two.)

no ipv6 ospf hello-interval *
no ipv6 ospf dead-interval*
ip ospf hello-interval 10
ip ospf dead-interval 40
no ipv6 ospf price 10
no ipv6 router ospf 10

33. Seek advice from the exhibit. A community administrator has configured the OSPF timers to the values which can be proven within the graphic. What’s the results of having these manually configured timers?

The R1 useless timer expires between hi there packets from R2.*
R1 mechanically adjusts its personal timers to match the R2 timers.
The hi there timer on R2 expires each ten seconds.
The neighbor adjacency has fashioned.

34. Why do OSPF serial interfaces normally require handbook bandwidth configuration?

OSPF makes use of the bandwidth worth to compute routes for its routing desk.*
All sides of an OSPF serial hyperlink must be configured with a novel worth.
All serial interfaces default to a price of 1.544 Mb/s.
Bandwidth worth impacts the precise velocity of the hyperlink.

35. Seek advice from the exhibit. R1 and R2 are linked to the identical LAN section and are configured to run OSPFv3. They don’t seem to be forming a neighbor adjacency. What’s the reason for the issue?

The IPv6 addresses of R1 and R2 should not in the identical subnet.
The OSPFv3 course of IDs of R1 and R2 are totally different.
The timer intervals of R1 and R2 don’t match.*
The precedence worth of each R1 and R2 is 1.

36. Seek advice from the exhibit. What sort of OSPF authentication has been configured on this interface?

37. Why is MD5 authentication safer than easy authentication for OSPF updates?

MD5 doesn’t ship the password to the neighbor router.*
MD5 requires passwords which can be at the very least 8 characters lengthy.
MD5 makes use of each a username and a password to authenticate the neighbor.
MD5 employs IPsec to maintain the updates from being intercepted.

Rationalization: MD5 doesn’t ship the configured password throughout the community. MD5 generates a particular hash, or signature, that’s hooked up to the messages and despatched to the neighbor. This signature is used to validate the neighbor as an alternative of the password. MD5 doesn’t use a username and doesn’t implement a minimal size on the password. Whereas IPsec tunnels can be utilized to maintain updates safe, they don’t seem to be used particularly by MD5.

38. A community engineer is troubleshooting convergence and adjacency points in an OSPFv2 community and has famous that some anticipated community route entries should not displayed within the routing desk. Which two instructions will present further details about the state of router adjacencies, timer intervals, and the realm ID? (Select two.)

present ip protocols
present ip ospf interface*
present ip route ospf
present ip ospf neighbor*
present running-configuration

Rationalization: The present ip ospf interface command will show routing desk data that’s already recognized. The present running-configuration and present ip protocols instructions will show elements of the OSPF configuration on the router however won’t show adjacency state particulars or timer interval particulars.

39. A community engineer is troubleshooting convergence and adjacency points in an OSPFv2 community and has famous that some anticipated community route entries should not displayed within the routing desk. Which two instructions will present further details about the state of router adjacencies, timer intervals, and the realm ID? (Select two.)

present ip protocols
present ip ospf interface*
present ip route ospf
present ip ospf neighbor*
present running-configuration

40. When OSPFv2 neighbors are establishing adjacencies, by which state do they elect a DR and BDR router?

Alternate state
Init state
Two-Manner state*
Loading state

Rationalization: Down state: No hi there packets are acquired.
Try: No latest data acquired by NBMA router, however nonetheless attempting to speak.
Init state: Hiya packets acquired, however bidirectional communication not established.
2-way state: Bidirectional communication is established and if wanted, a DR/BDR election happens.
ExStart state: Negotiate grasp/slave function for LSDB synchronization.
Alternate state: Alternate of DBD packets happens.
Loading state: Request for extra data is shipped.
Full state: Routers converged and neighbors are totally adjoining.

41. A community engineer is troubleshooting an OSPFv2 community and discovers that two routers linked by a point-to-point WAN serial hyperlink should not establishing an adjacency. The OSPF routing course of, community instructions and space ID are all confirmed as right, and the interfaces should not passive. Testing reveals that the cabling is right, that the hyperlink is up, and pings between the interfaces are profitable. What’s almost definitely the issue?

The subnet masks on the 2 linked serial interfaces don’t match.*
A clock charge has not been set on the DCE interface of the serial hyperlink.
The OSPFv2 course of IDs on every router don’t match.
A DR election has not taken place.

Rationalization: The institution of an OSPF adjacency between linked routers requires every interface of the hyperlink to be in the identical subnet. This requires every interface to be configured with right IP addresses and the identical subnet masks. Pings throughout serial hyperlinks could be profitable with right IP addresses and totally different subnet masks. Profitable pings confirm {that a} clock charge has been set on the DCE interface of the serial hyperlink. The OSPFv2 course of IDs on every router are native and don’t must match. A DR election doesn’t happen throughout point-to-point serial hyperlinks between OSPF routers.

42. A community engineer is troubleshooting OSPFv2 routing points on two linked routers. Which two necessities to type an adjacency must be verified? (Select two.)

Confirm that one of many interfaces that connects the 2 routers is lively and the opposite passive.
Confirm that one of many routers is the DR or BDR and the opposite router a DRother.
Confirm that the interfaces that join the 2 routers are in the identical subnet. *
Confirm that the interfaces that join the 2 routers are in the identical space.*
Confirm that each routers are utilizing the identical OSPFv2 course of ID.

43. Which command is used to confirm that OSPF is enabled and in addition offers a listing of the networks which can be being marketed by the community?

present ip protocols*
present ip ospf interface
present ip interface transient
present ip route ospf

Rationalization: The command present ip ospf interface verifies the lively OSPF interfaces. The command present ip interface transient is used to test that the interfaces are operational. The command present ip route ospf shows the entries which can be discovered by way of OSPF within the routing desk. The command present ip protocol s checks that OSPF is enabled and lists the networks which can be marketed.

44. Seek advice from the exhibit. 4 routers are linked to an Ethernet LAN section and are configured to run OSPFv3. Nevertheless, not one of the routers are receiving routing updates. What’s the reason for the issue?

The routers are utilizing IPv4 addresses for router IDs.
The entire routers have an OSPFv3 interface precedence of 0.*
The community sort has been set to BROADCAST as an alternative of NBMA.
The routers are utilizing IPv6 hyperlink native addresses to speak.

45. Seek advice from the exhibit. These two routers are configured to run OSPFv3 however they don’t seem to be forming a neighbor adjacency. What’s the reason for the issue?

The routers have the identical precedence.
The routers have each been elected because the DR.
The routers are configured with the identical router ID.*
The routers wouldn’t have world IPv6 addresses which can be configured on the Fa0/0 interfaces.

46. Seek advice from the exhibit. An administrator is attempting to configure R1 to run OSPFv3 however the neighbor adjacency is just not forming with the router linked to Fa0/0. What’s the reason for the issue?

No router ID has been configured.*
FastEthernet0/0 has been configured as a passive interface.
A link-local tackle has not been configured on interface FastEthernet0/0.
The OSPF course of ID and space values are backwards within the interface configuration.

Rationalization: The output of present ipv6 ospf interface fa0/0 reveals that OSPFv3 is just not enabled on the interface though the command is within the working configuration. It’s because no router ID has been configured on this router. The router ID in OSPFv3 is a 32 bit quantity, much like the ID in OSPFv2. If the router ID is just not manually specified then an IPv4 tackle from one of many interfaces is used as an alternative. This router has no IPv4 addresses configured on it so a router ID can’t be mechanically chosen. The router-id command should be configured underneath ipv6 router ospf 1 so as to repair this downside.

47. Seek advice from the exhibit. Fill within the clean. Don’t use abbreviations.The command present ipv6 route could be issued on router R2 to confirm the propagation of a static default route from R1 to R2.

48. Fill within the clean. Don’t use abbreviations.When IPv4 and OSPFv2 are getting used, the command present ip ospf neighbor is used to confirm {that a} router has fashioned an adjacency with its neighboring routers.

49. Seek advice from the exhibit. Which conclusion could be drawn from this OSPF multiaccess community?

When a DR is elected all different non-DR routers grow to be DROTHER.
All DROTHER routers will ship LSAs to the DR and BDR to multicast 224.0.0.5.
If the DR stops producing Hiya packets, a BDR can be elected, after which it promotes itself to imagine the function of DR.
With an election of the DR, the variety of adjacencies is diminished from 6 to three.*

50. What’s a really useful methodology of authentication for OSPFv3?

MD5 authentication
IPsec to safe routing updates*
the passive-interface command
a VPN tunnel between every OSPF neighbor adjacency

51. A totally converged 5 router OSPF community has been working efficiently for a number of weeks. All configurations have been saved and no static routes are used. If one router loses energy and reboots, what data can be in its routing desk after the configuration file is loaded however earlier than OSPF has converged?

All routes for the whole community can be current.
Instantly linked networks which can be operational can be within the routing desk.*
As a result of the SPF algorithm has not accomplished all calculations, no routes can be within the desk.
A abstract route for all beforehand discovered routes will mechanically seem within the routing desk till all LSPs have been acquired by the router.

52. Throughout verification or troubleshooting of the OPSFv3 configuration on a router, which three parameters are displayed by the present ipv6 ospf interface command? (Select three.)

the hi there and useless intervals*
the worldwide unicast IPv6 tackle of the interface
the metric of the route that’s hooked up to the interface
the OSPFv3 space that the interface is in *
the method ID that’s assigned to the interface*
the variety of interfaces within the space

53. The PT initialization was skipped. You will be unable to view the PT exercise.
Open the PT Exercise. Carry out the duties within the exercise directions after which reply the query.
Which activity must be carried out on Router 1 for it to determine an OSPF adjacency with Router 2?

Challenge the clear ip ospf course of command.
Take away the passive interface command from interface FastEthernet 0/0.
Add the community 10.0.1.0 0.0.0.255 space 0 command to the OSPF course of.
Change the subnet masks of interface FastEthernet 0/0 to 255.255.255.0.*

54. Match every OSPF state to its perform. (Not all choices are used.)

Place the choices within the following order:
– not scored –
full state -> Routers have converged.
loading state -> LSRs and LSUs are used to realize further route data.
ExStart state -> Grasp / slave relationships are negotiated.

55. Match every OSPF election criterion to its sequential order for the OSPF DR and BDR election course of. (Not all choices are used.)

Place the choices within the following order:
third -> Elect the router with the very best IPv4 tackle on loopback interfaces.
second -> Elect the router with the very best manually configured router ID.
– not scored –
first -> Elect the router with the very best interface precedence
fourth -> Elect the router with the very best lively IPv4 tackle on bodily interfaces.

56. A community engineer is researching dynamic routing protocols and the way a lot time it takes for a community to converge. What does it imply for a router to attain convergence?

The period of time it takes a router to share data, calculate finest paths, and replace the routing desk*
The potential to move information, video, and voice over the identical media
The period of time a community administrator must configure a routing protocol in a small- to medium-sized community
The potential to ahead visitors between hosts on an area community

Obtain PDF File beneath:

[sociallocker id=”54558″]

[/sociallocker]

[ad_2]

Trending Tags

Trending Tags

CCNA 3 (v5.0.3 + v6.0) Chapter 5 Exam Answers 2020

Older Model

Related posts:

Related Posts

Categories

Recent Posts

Categories

Tags