Midterm Examination (II-AINS) 1

RIP prevents routing loops by implementing a limit

on the number of (a)   allowed in a path from the source to a destination

The maximum number of hops allowed for RIP v.1 is (a)   .

In RIPv2, (a)   masks are included in the routing update.

In EIGRP, information about all destination networks

reported by the neighbors is stored in (a)   table.

EIGRP uses a (a)   algorithm to avoid loops and send occasional hello packets to check the status of neighbor routers.

In OSPF, an (a)   is used to connect the backbone area and non-backbone areas.

The diffusing update algorithm is the algorithm used by Cisco's EIGRP routing protocol

to ensure that a given route is (a)   globally whenever it might cause a routing loop.

In EIGRP, once the router sends a hello (a)   and receives a reply hello,

they become neighbors.

If the default hello interval in EIGRP is 60 seconds, therefore its default hold time is (a)   seconds.

The first and the second-best paths for each route are stored in (a)   table.