- 4.9/5.0
- 268 Questions
- Updated on: 25-May-2026
- 300-510
- 22685 Prepared
Free Cisco 300-510 Practice Questions 2026 | 300-510
Refer to the exhibit.

A network engineer must optimize link failures on the OSPF routing domain. The solution
must follow RFC 5286. and downtime must be no more than 50 ms. All known subnets on
R1 must be protected. Which solution must the engineer implement on R1?
A. Configure fp ospf frr per-prefix candidate enable high under the interface configuration.
B. Configure Ip ospf fast-reroute per-prefix candidate enable under the interface configuration.
C. Configure fast-reroute per-prefix enable prefix-priority low under the global OSPF configuration.
D. Configure frr per-prefix enable priority high under the global OSPF configuration.
Refer to the exhibit.

Which task must you perform on interface g1/0/0 to complete the SSM implementation?
A. configure OSPFv3
B. enable CDP
C. disable IGMP
D. configure IGMPv3
Refer to the exhibit.

A network operator wants to expand the segment routing global block in upcoming
maintenance. The operator must ensure that the changes to the segment routing global
block have no adverse impacts on the prefix-sid associated with the loopback0 interface
used within the OSPF domain.
Which command can the operator use to enforce R2 to have a strict prefix-sid assignment
to loopback0
A. Option A
B. Option B
C. Option C
D. Option D
Which BGP well-known attributes are preserved between peers with a BGP confederation?
A. origin and MED
B. originator and origin
C. next-hop and local-preference
D. next-hop and weight
Refer to the exhibit.

How are packets directed through the data plane when SRv6 is implemented?
A. An ordered list of segments is encoded in a routing extension header
B. The MPLS data plane is used to push labels onto IGP routes
C. A stack of labels represents an ordered list of segments
D. The packet is encapsulated with a header and trailer encoding the ordered list of segments
Refer to the exhibit.

Router 1 has established an SR-TE tunnel with router 2. Which statement describes this
configuration?
A. Router 1 has a list of labels used to explicitly lay out a path to router 2.
B. Router 1 and router 2 have a bidirectional tunnel set up with dynamic path selection.
C. Router 1 is the head-end tunnel and has dynamically chosen a path to router 2.
D. Router 2 is the head-end tunnel and has explicitly set a path to router 1.
Refer to the exhibit.

XR1 and XR2 are sending the prefix 10.11.11.0/24 to XR3. A configured policy on XR1 is
incorrectly prepending AS path 11 11 12 12 onto this prefix. A network operator wants to
add a policy onto XR3 that will not allow the falsely prepending prefix from being installed.
Which policy configuration applied to the XR3 neighbor configuration for XR1 can
accomplish this requirement without impact to other or future
received routes?
A. Option A
B. Option B
C. Option C
D. Option D
Which attribute is used to instruct the router that packets must be processed by an ASA that is associated with the segment?
A. service SID with service instructions
B. node SID that identifies a specific network device
C. prefix SID that represents a specific route prefix
D. adjacency SID with unidirectional adjacency instructions
Refer to the exhibit. After creating dynamic neighbors for the range specified, the network administrator with an employee ID: 4690:88:374 cannot see all the BGP neighbors established. What is the issue?
A. The single activated neighbor cannot be within the listen range.
B. A list of neighbors belongs only to a defined ASN.
C. The peer groups must also be activated inside the address family.
D. The listen limit is smaller than the prefix defined in the listen range.
How does the SRv6 IS-IS Flexible Algorithm function on the data plane?
A. It uses the TE metric in its path calculations to optimize the cumulative TE metric.
B. It uses the IGP metric in its path calculations to optimize reachability.
C. It automatically delivers traffic to the destination over an engineered path computed by the IGP.
D. It applies path computation algorithms to learn the topology and compute a pair of disjoint LSPs.
| Page 8 out of 27 Pages |