Q31. Which statement about the feasibility condition in EIGRP is true?

A. The prefix is reachable via an EIGRP peer that is in the routing domain of the router.

B. The EIGRP peer that advertises the prefix to the router has multiple paths to the destination.

C. The EIGRP peer that advertises the prefix to the router is closer to the destination than the router.

D. The EIGRP peer that advertises the prefix cannot be used as a next hop to reach the destination.

Explanation:

The advertised metric from an EIGRP neighbor (peer) to the local router is called Advertised Distance (or reported distance) while the metric from the local router to that network is called Feasible Distance. For example, R1 advertises network 10.10.10.0/24 with a metric of 20 to R2. For R2, this is the advertised distance. R2 calculates the feasible distance by adding the metric from the advertised router (R1) to itself. So in this case the feasible distance to network 10.10.10.0/24 is 20 + 50 = 70.

Before a router can be considered a feasible successor, it must pass the feasibility condition rule. In short, the feasibility condition says that if we learn about a prefix from a neighbor, the advertised distance from that neighbor to the destination must be lower than our feasible distance to that same destination. Therefore we see the Advertised Distance always smaller than the Feasible Distance to satisfy the feasibility condition.

Q32. Which algorithm heavily influenced the algorithm used by path-vector protocols?

A. Bellman-Ford

B. SPF

C. DUAL

D. Spanning-Tree

F. Deflection

Explanation:

A path vector protocol is a computer network routing protocol which maintains the path information that gets updated dynamically. Updates which have looped through the network and returned to the same node are easily detected and discarded. This algorithm is sometimes used in Bellman–Ford routing algorithms to avoid "Count to Infinity" problems.

Reference: http://en.wikipedia.org/wiki/Path_vector_protocol

Q33. Which BGP feature allows BGP routing tables to be refreshed without impacting established BGP sessions?

A. BGP synchronization

B. soft reconfiguration

C. confederations

D. hard reset

Explanation:

Clearing a BGP session using a hard reset invalidates the cache and results in a negative impact on the operation of networks as the information in the cache becomes unavailable. Soft reset is recommended because it allows routing tables to be reconfigured and activated without clearing the BGP session. Soft reset is done on a per-neighbor basis.

Reference: http://www.cisco.com/en/US/products/ps6599/products_data_sheet09186a0080087b3a.ht ml

Q34. Refer to the exhibit.

R2 is configured as the R1 neighbor in area 51, but R2 fails to receive the configured summary route. Which action can you take to correct the problem?

A. Replace the summary-address command with the area-range command.

B. Configure a summary address under R1interface GigabitEthernet0/0.

C. Configure a summary address under R1 interface GigabitEthernet1/0.

D. Configure the no discard-route command in the OSPF process of R1.

E. Configure ip ospf network broadcast under the Loopback0 interface of R1.

Q35. An access switch at a remote location is connected to the spanning-tree root with redundant uplinks. A network engineer notices that there are issues with the physical cabling of the current root port. The engineer decides to force the secondary link to be the desired forwarding root port. Which action accomplishes this task?

B. Change the link type to point-to-point.

C. Apply a BPDU filter on the primary interface of the remote switches.

D. Enable Rapid Spanning Tree to converge using the secondary link.

Q36. Which circumstance can cause TCP starvation and UDP dominance to occur?

A. Too few queues are available.

B. UDP is comprised of smaller packets than TCP.

C. Retransmitted TCP packets are on the network.

D. UDP and TCP data are assigned to the same service-provider class.

Q37. Which two protocols are used to establish IPv6 connectivity over an MPLS network? (Choose two.)

A. 6PE

B. 6VPE

C. RSVP

D. ISATAP

E. LDP

F. IPv6IP

Q38. Which two statements about Inverse ARP are true? (Choose two.)

A. It uses the same operation code as ARP.

B. It uses the same packet format as ARP.

C. It uses ARP stuffing.

D. It supports static mapping.

Explanation:

Inverse Address Resolution Protocol (Inverse ARP or InARP) is used to obtain Network Layer addresses (for example, IP addresses) of other nodes from Data Link Layer (Layer 2) addresses. It is primarily used in Frame Relay (DLCI) and ATM networks, in which Layer 2 addresses of virtual circuits are sometimes obtained from Layer 2 signaling, and the corresponding Layer 3 addresses must be available before those virtual circuits can be used.

Since ARP translates Layer 3 addresses to Layer 2 addresses, InARP may be described as its inverse. In addition, InARP is implemented as a protocol extension to ARP: it uses the same packet format as ARP, but different operation codes.

Q39. Refer to the exhibit.

A. Router 1 acts as the primary key server because it has a higher priority.

B. An RSA key has been imported into the configuration.

C. The GDOI group configuration generated a key.

D. DPD is disabled.