4A0-112 Practice Exam Questions and Answers

A.  

1

B.  

2

C.  

3

D.  

4

A.  

The router sends a copy of the referenced LSP from its database to its neighbor.

B.  

The router sends a CSNP to its neighbor describing the newer LSPs in its database.

C.  

The router updates its database with the new sequence number and floods a copy of the LSP to its other neighbors.

D.  

The router sends a PSNP to its neighbor to request a copy of the LSP.

A.  

The value of the Ethernet hello timers on the switches.

B.  

The value of the routingprotocol hello timers on routers R1 and R3.

C.  

The value of the BFD transmit interval, receive interval and multiplier settings on routers R1 and R3.

D.  

The time taken by the switches to detect that the physical ports are down.

A.  

2001:0da8::0024:0000:4ab9:03

B.  

2001:da8::0:24::4ab9:300

C.  

2001:da8::24::4ab9:300

D.  

2001:da8::24:0:4ab9:300

A.  

Calculating the shortest-path next hop for each known IP prefix.

B.  

Calculating a backup next hop for each known IP prefix, if it exists, that would not create a routing loop if used without informing other routers.

C.  

Installing two entries in the FIB for IP prefixes, one active and one in standby mode.

D.  

Enabling the router to locally repair the active path to an IP prefix in case of failure.

A.  

Router R1 to router R7 will follow (R1-R2-R4-R6-R7). Router R7 to router R1 will follow (R7-R6-R4-R2-R1).

B.  

Router R1 to router R7 will follow (R1-R2-R4-R6-R7). Router R7 to router R1 will follow (R7-R6-R5-R3-R1).

C.  

Router R1 to router R7 will follow (R1-R3-R5-R6-R7). Router R7 to router R1 will follow (R7-R6-R4-R2-R1).

D.  

Router R1 to router R7 will follow (R1-R3-R5-R6-R7). Router R7 to router R1 will follow (R7-R6-R5-R3-R1).

A.  

The IP prefixes of subnets directly attached to the router.

B.  

IP prefixes known by the router because it is running ad additional routing protocol.

C.  

A copy of the local routing table.

D.  

The local router ID and the router IDs of neighboring routers.

A.  

Duplicate address detection procedures.

B.  

Router discovery procedures.

C.  

Neighbor discovery procedures.

D.  

Stateless address auto-configuration procedures.

A.  

When a link-state update reaches its maximum age on a router, the router will flood that update to its neighbors.

B.  

When a router detects that a link-state update has reached its maximum age, it will request a new update from the source router.

C.  

Aging helps ensure that routers that are no longer part of the topology will eventually get removed from the link-state database.

D.  

The age value is updated as the link-state update is flooded throughout the network and when it is in the link-state database

A.  

The routers do not agree on the result of the DIS election.

B.  

The routers discard the received Hello messages because they are not the expected type: LAN Hello vs point-to-point Hello.

C.  

The routers do not receive each other’s Hello messages because they listen for messages transmitted to different multicast MAC addresses.

D.  

The routers do not receive each other’s Hello messages because they listen for messages transmitted to different multicast IP addresses.