CCNP ROUTE (Version 6.0) Chapter 2 Exam Answers

Assessment – ROUTE Chapter 2 – CCNP ROUTE (Version 6.0) Exam Answers

1. Which EIGRP algorithm tracks all the routes that are advertised by neighbors and uses the composite metric of each route to compare the routes?

  • STP
  • Dijkstra
  • DUAL
  • SPF

2. Which two statements are true of EIGRP topology depth? (Choose two.)

  • Topology depth should be limited to 15 routers.
  • Redundant links and alternative paths can be used to reduce topology depth.
  • Topology depth is the maximum hop count between any two EIGRP routers in the topology.
  • Route summarization can reduce the convergence time in networks with large depth.
  • Topology depth is the number of router hops necessary for traffic to reach from access layer to core layer.
  • Topology depth refers to the total number of hops that information must travel to reach all EIGRP routers in the network.

3. Refer to the exhibit. Which statement is true of the EIGRP keys that are used by router R2?

CCNP ROUTE (Version 6.0) Chapter 2 Exam Answers 1

  • R2 is encrypting EIGRP packets with only key 1.
  • R2 is encrypting EIGRP packets with both key 1 and key 2.
  • R2 is using only key 2 to authenticate received EIGRP packets.
  • R2 is authenticating received EIGRP packets with both key 1 and key 2.

4. Which event must take place to transition an EIGRP route that is in the active state back to the passive state?

  • expiration of the RTO timer
  • an update packet that is received from every EIGRP neighbor
  • an acknowledgment that is received from every EIGRP neighbor
  • a reply that is received from each neighbor for every generated query
  • a feasible successor route that is moved from the topology table to the routing table

5. Refer to the exhibit. During a test of an EIGRP prototype network, a network administrator issues a show ip protocols command. What two facts can be determined from the output? (Choose two.)

CCNP ROUTE (Version 6.0) Chapter 2 Exam Answers 2

  • The administrative distance is 100.
  • This router will not accept routes that are more than 100 hops away.
  • There are 10 Cisco devices in this prototype network.
  • The auto-summary command was applied on this router.
  • EIGRP is using two values for the calculation of the composite metric.
  • EIGRP on this router will display up to four unequal cost routes to the same destination.

6. Which statement is a requirement for the EIGRP AS number?

  • It is the EIGRP router ID and must be the same on each router in the EIGRP domain.
  • It is only locally significant, and as a result it can be different on each router in the EIGRP domain.
  • It is selected by the network administrator and must be the same on each router in the EIGRP domain.
  • It is assigned by IANA and must be the same on each router in the EIGRP domain.

7. Which design plan or diagram would govern how well EIGRP will scale?

  • IP addressing plan
  • STP topology diagram
  • Layer 2 addressing plan
  • detailed cabling plan
  • EIGRP traffic engineering plan

8. The network administrator wants RTA to send only the summarized route of 10.10.0.0/16 to RTB. Which configuration will accomplish this?

CCNP ROUTE (Version 6.0) Chapter 2 Exam Answers 3

  • RTA(config)# interface s0/0
    RTA(config-if)# ip summary-address eigrp 101 10.10.0.0 255.255.0.0
    RTA(config-if)# exit
    RTA(config)# router eigrp 101
    RTA(config-router)# no auto-summary
  • RTA(config)# interface s0/1
    RTA(config-if)# ip summary-address eigrp 101 10.10.0.0 255.255.0.0
    RTA(config-if)# exit
    RTA(config)# router eigrp 101
    RTA(config-router)# no auto-summary
  • RTA(config)# interface s0/0
    RTA(config-if)# ip summary-address eigrp 101 10.10.0.0 255.255.0.0
  • RTA(config)# interface s0/1
    RTA(config-if)# ip summary-address eigrp 101 10.10.0.0 255.255.0.0

9. Refer to the exhibit. Which statement is true about the EIGRP hello packets that are received by router R2?

CCNP ROUTE (Version 6.0) Chapter 2 Exam Answers 4

  • They are encrypted.
  • They are authenticated.
  • They are sent confidentially.
  • They must be acknowledged.

10. Which two solutions are used in an EIGRP network to reduce DUAL computations? (Choose two.)

  • authentication
  • load balancing
  • partial updates
  • summarization
  • EIGRP stub routing

11. Which three technologies are used in EIGRP? (Choose three.)

  • Dijkstra algorithm
  • DUAL finite-state machine
  • reliable transport protocol
  • link-state advertisements
  • protocol-specific modules
  • Bellman-Ford algorithm

12. When does an EIGRP router place a route in the active state?

  • when there is no successor route in the routing table
  • when the feasible distance is greater than the reported distance of the route
  • when an update packet containing information about the route is not acknowledged
  • when the current successor is no longer valid and there is no feasible successor in the topology table

13. What are two advantages to deploying a hierarchical IP addressing scheme in an EIGRP network? (Choose two.)

  • greater redundancy
  • improved scalability
  • ability to use network route summarization
  • better route optimization creating shorter paths
  • fewer network addresses that need to be allocated for the network

14. Refer to the exhibit. Based on the output of show ip eigrp neighbors, what are two possible problems with adjacencies between Router1 and Router2? (Choose two.)

CCNP ROUTE (Version 6.0) Chapter 2 Exam Answers 5

  • The routers are configured with different EIGRP AS numbers.
  • Automatic summarization was disabled.
  • The hello timer for R1 was altered.
  • The serial interfaces for both routers are in different networks.
  • No feasible successors were found.

15. Which action is effective in preventing EIGRP routes from becoming SIA?

  • Use multiple EIGRP autonomous systems to bound the query range.
  • Modify keepalive timers on point-to-point connections.
  • Maintain a hierarchical network design.
  • Keep K-values at default settings.

16. Refer to the exhibit. A network administrator has configured R1 and R2 for EIGRP authentication with multiple keys and activation times. After functioning normally for a month, R1 and R2 are now no longer forming an EIGRP adjacency. Which configuration change to the key lifetimes will correct the EIGRP adjacency problem?

CCNP ROUTE (Version 6.0) Chapter 2 Exam Answers 6

  • Change the key 1 accept life to an end time of Feb 1 on both routers.
  • Change key 2 send lifetime to a start time of Jan 1 on both routers.
  • Change the key 1 send lifetime to an end time of Feb 1 on both routers.
  • Change the key 2 accept lifetime to a start time of infinite on both routers.

17. Which EIGRP packet type can quickly propagate through a network and result in excessive DUAL computations and high CPU loads?

  • acknowledgment
  • hello
  • reply
  • update
  • query

18. A router in a fully converged EIGRP network detects that a remote route is unreachable. Which two events may occur next? (Choose two.)

  • EIGRP will look for a feasible successor in the routing table.
  • DUAL will calculate the highest cost routes to each network.
  • EIGRP will send a bounded update to alert neighbors about the failure.
  • The router will forward the complete routing table to the neighboring routers.
  • DUAL will look for a feasible successor route in the topology table and, if one is found, it will add this route to the routing table.

19. What are two advantages of modifying the interface metrics when deploying EIGRP in a network? (Choose two.)

  • improved bandwidth utilization
  • less likely to have routing loops
  • faster convergence
  • better control over traffic patterns
  • more efficient troubleshooting

20. Refer to the exhibit. All three routers are exchanging EIGRP routes. What value represents the advertised distance of the feasible successor for the 10.1.2.0/24 network?

CCNP ROUTE (Version 6.0) Chapter 2 Exam Answers 7

  • 256
  • 532
  • 768
  • 1280
Subscribe
Notify of
guest

0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x