Download Implementing Cisco Enterprise Advanced Routing and Services.CertsHero.300-410.2023-01-23.1e.297q.vcex

Download Exam

File Info

Exam Implementing Cisco Enterprise Advanced Routing and Services (300-410 ENARSI)
Number 300-410
File Name Implementing Cisco Enterprise Advanced Routing and Services.CertsHero.300-410.2023-01-23.1e.297q.vcex
Size 40.25 Mb
Posted January 23, 2023
Downloads 12
Download Implementing Cisco Enterprise Advanced Routing and Services.CertsHero.300-410.2023-01-23.1e.297q.vcex

How to open VCEX & EXAM Files?

Files with VCEX & EXAM extensions can be opened by ProfExam Simulator.


With discount: 20%


Demo Questions

Question 1

Refer to the exhibit.


Users in the branch network of 2001:db8:0:4::/64 report that they cannot access the Internet. 
Which command is issued in IPv6 router EIGRP 100 configuration mode to solve this issue?

  • A: Issue the eigrp stub command on R1
  • B: Issue the no neighbor stub command on R2.
  • C: Issue the eigrp command on R2.
  • D: Issue the no eigrp stub command on R1.

Correct Answer: D

Question 2

Refer to the exhibit.


Which configuration configures a policy on R1 to forward any traffic that is sourced from the network to R2?



  • A: Option A
  • B: Option B
  • C: Option C
  • D: Option D

Correct Answer: D

Question 3

R2 has a locally originated prefix and has these configurations:


What is the result when the route-map OUT command is applied toward an eBGP neighbor R1 ( by using the neighbor route-map OUT out command?

  • A: R1 sees as two AS hops away instead of one AS hop away.
  • B: R1 does not accept any routes other than
  • C: R1 does not forward traffic that is destined for
  • D: Network is not allowed in the R1 table

Correct Answer: A

Question 4

Refer to the exhibit.


The output of the trace route from R5 shows a loop in the network. Which configuration prevents this loop?







  • A: Option A
  • B: Option B
  • C: Option C
  • D: Option D

Correct Answer: A

The reason for the loop is that R2 is forwarding the packets destined to to R4, instead of R1.
This is because in the redistribute OSPF statement, BW metric has a higher value and delay has a value of 1. So, R2 chooses R4 over R1 for subnet causing a loop. Now, R5 learns from R3 and advertises the same route to R4, that R4 redistributes back in EIGRP. If R3 sets a tag of 1 while redistributing EIGRP in OSPF, and R4 denies all the OSPF routes with tag 1 while redistributing, it will not advertise back into EIGRP. Hence, the loop will be broken.

Question 5

Refer to the exhibit.


An engineer configures a static route on a router, but when the engineer checks the route to the destination, a different next hop is chosen. What is the reason for this?

  • A: Dynamic routing protocols always have priority over static routes.
  • B: The metric of the OSPF route is lower than the metric of the static route.
  • C: The configured AD for the static route is higher than the AD of OSPF.
  • D: The syntax of the static route is not valid, so the route is not considered.

Correct Answer: C

The AD of static route is manually configured to 130 which is higher than the AD of OSPF router which is 110.

Question 6

Refer to the exhibit.


An engineer is trying to block the route to from the routing table by using the configuration that is shown. The route is still present in the routing table as an OSPF route. Which action blocks the route?

  • A: Use an extended access list instead of a standard access list.
  • B: Change sequence 10 in the route-map command from permit to deny.
  • C: Use a prefix list instead of an access list in the route map.
  • D: Add this statement to the route map: route-map RM-OSPF-DL deny 20.

Correct Answer: B

Question 7

Drag and drop the OSPF adjacency states from the left onto the correct descriptions on the right.

Correct Answer: Exam simulator is required

(Reference: tml)
This is the first OSPF neighbor state. It means that no information (hellos) has been received from this neighbor, but hello packets can still be sent to the neighbor in this state.
During the fully adjacent neighbor state, if a router doesn't receive hello packet from a neighbor within the Router Dead Interval time (RouterDeadInterval = 4*HelloInterval by default) or if the manually configured neighbor is being removed from the configuration, then the neighbor state changes from Full to Down.
This state is only valid for manually configured neighbors in an NBMA environment. In Attempt state, the router sends unicast hello packets every poll interval to the neighbor, from which hellos have not been received within the dead interval.
This state specifies that the router has received a hello packet from its neighbor, but the receiving router's ID was not included in the hello packet. When a router receives a hello packet from a neighbor, it should list the sender's router ID in its hello packet as an acknowledgment that it received a valid hello packet.
This state designates that bi-directional communication has been established between two routers.
Bi-directional means that each router has seen the other's hello packet. This state is attained when the router receiving the hello packet sees its own Router ID within the received hello packet's neighbor field. At this state, a router decides whether to become adjacent with this neighbor. On broadcast media and non-broadcast multiaccess networks, a router becomes full only with the designated router (DR) and the backup designated router (BDR); it stays in the 2-way state with all other neighbors. On Point-to-point and Point-to-multipoint networks, a router becomes full with all connected routers.
At the end of this stage, the DR and BDR for broadcast and non-broadcast multiaccess networks are elected. For more information on the DR election process, refer to DR Election.
Note: Receiving a Database Descriptor (DBD) packet from a neighbor in the init state will also a cause a transition to 2-way state.
Once the DR and BDR are elected, the actual process of exchanging link state information can start between the routers and their DR and BDR. (ie. Shared or NBMA networks).
In this state, the routers and their DR and BDR establish a master-slave relationship and choose the initial sequence number for adjacency formation. The router with the higher router ID becomes the master and starts the exchange, and as such, is the only router that can increment the sequence number. Note that one would logically conclude that the DR/BDR with the highest router ID will become the master during this process of master-slave relation. Remember that the DR/BDR election might be purely by virtue of a higher priority configured on the router instead of highest router ID.
Thus, it is possible that a DR plays the role of slave. And also note that master/slave election is on a per-neighbor basis.
In the exchange state, OSPF routers exchange database descriptor (DBD) packets. Database descriptors contain link-state advertisement (LSA) headers only and describe the contents of the entire link-state database. Each DBD packet has a sequence number which can be incremented only by master which is explicitly acknowledged by slave. Routers also send link-state request packets and link-state update packets (which contain the entire LSA) in this state. The contents of the DBD received are compared to the information contained in the routers link-state database to check if new or more current link-state information is available with the neighbor.
In this state, the actual exchange of link state information occurs. Based on the information provided by the DBDs, routers send link-state request packets. The neighbor then provides the requested link-state information in link-state update packets. During the adjacency, if a router receives an outdated or missing LSA, it requests that LSA by sending a link-state request packet. All link-state update packets are acknowledged.
In this state, routers are fully adjacent with each other. All the router and network LSAs are exchanged and the routers' databases are fully synchronized.
Full is the normal state for an OSPF router. If a router is stuck in another state, it is an indication that there are problems in forming adjacencies. The only exception to this is the 2-way state, which is normal in a broadcast network. Routers achieve the FULL state with their DR and BDR in NBMA/bro adcast media and FULL state with every neighbor in the remaining media such as point-to-point and point-to-multipoint.
Note: The DR and BDR that achieve FULL state with every router on the segment will display FULL/DROTHER when you enter the show ip ospf neighbor command on either a DR or BDR. This simply means that the neighbor is not a DR or BDR, but since the router on which the command was entered is either a DR or BDR, this shows the neighbor as FULL/DROTHER.

Question 8

Refer to the exhibit.


R2 is a route reflector, and R1 and R3 are route reflector clients. The route reflector learns the route to from R1, but it does not advertise to R3. 
What is the reason the route is not advertised?

  • A: R2 does not have a route to the next hop, so R2 does not advertise the prefix to other clients.
  • B: Route reflector setup requires full IBGP mesh between the routers.
  • C: In route reflector setup, only classful prefixes are advertised to other clients.
  • D: In route reflector setups, prefixes are not advertised from one client to another. 

Correct Answer: A

Question 9

Refer to the exhibit.


In which circumstance does the BGP neighbor remain in the idle condition?

  • A: if prefixes are not received from the BGP peer
  • B: if prefixes reach the maximum limit
  • C: if a prefix list is applied on the inbound direction
  • D: if prefixes exceed the maximum limit

Correct Answer: D

Question 10

Which attribute eliminates LFAs that belong to protected paths in situations where links in a network are connected through a common fiber?

  • A: shared risk link group-disjoint
  • B: linecard-disjoint
  • C: lowest-repair-path-metric
  • D: interface-disjoint

Correct Answer: A





You can buy ProfExam with a 20% discount!


Use ProfExam Simulator to open VCEX and EXAM files