A. It immediately sends its entire routing table to its neighbors.
B. EIGRP sends a Hello packet to the DR to inform it of the route failure.
C. It automatically forwards traffic to a fallback default route until a successor route is found.
D. It sends queries out to neighbors until a new successor route is found.
E. It places the route in holddown until LSA updates inform it of a new route to the network.

A. Neighbor table
B. SPF table
C. RTP table
D. Topology table
E. Query table
F. DUAL table

A. The use of discontiguous subnets is not allowed
B. The use of variable length subnet masks is permitted
C. RIP v1 is a classless routing protocol
D. IGRP supports classless routing within the same autonomous system
E. RIP v2 supports classless routing

A. A successor route is used by EIGRP to forward traffic to destination.
B. Successor routes are saved in the topology table to be used if the primary route fails.
C. Successor routes are flagged as "active" in the routing table.
D. A successor route may be backed up by a feasible successor route.
E. Successor routes are stored in the neighbor table following the discovery process.

A. In the routing table only.
B. In the neighbor table only.
C. In the topology table only.
D. In the routing table and neighbor table.
E. In the routing table and topology table.
F. In the topology table and neighbor table.

A. point-to-point
B. Backbone area 0
C. Broadcast multicast
D. Non-broadcast multi-access
E. The DR/BDR process is done for all interface types

A. The update information will be added to the existing routing table.
B. The update information will replace the existing routing table entry.
C. The update will be ignored and thus no further action will occur.
D. The existing routing table entry will be purged from the routing table and all routers will attempt convergence.

A.90
B.100
C.110
D.120
E.130
F.170
G.200

A. It will ignore the update and take no further action.
B. It will add the update information to its routing table.
C. It will replace the existing routing table entry with the update information.
D. It will delete the existing routing table and will send out hello packets to rebuild the routing table.

A. Only the first two paths that are learned.
B. Four of the paths.
C. All six routes in a routed robin fashion.
D. The oldest two paths in the routing table.
E. The first path learned to the destination network.