A. IGRP has a faster update timer.
B. IGRP has a lower administrative distance.
C. RIP has a higher metric value for that route.
D. The IGRP route has fewer hops.
E. The RIP path has a routing loop.

A. All entries in the topology database will be included on each router.
B. All routers in the same OSPF area will have one topology database.
C. The Dijkstra algorithm is used in the creation of the topology database.
D. LSA packets are used to update and maintain the topology database.

A. It is needed to identify a unique instance of an OSPF database.
B. It is an optional parameter only necessary if multiple OSPF processes are used.
C. It is locally significant.
D. It is globally insignificant
E. All routers in the same OSPF area must have the same process ID to exchange routing information.

A. Has a maximum hop count of 25
B. Can differentiate between internal and external routes
C. Uses a 32-bit metric
D. Can maintain only one routing table
E. Need all networks to use the same subnet mask
F. Supports only one routed protocol

A. Every 5 minutes
B. Every 90 seconds
C. Every 60 seconds
D. Every 30 seconds

A. Point-to-point and point-to-multipoint networks
B. Nonbroadcast and broadcast multipoint multicasting
C. Point-to-point and multi-access broadcasting
D. Point-to-multipoint and multi-access broadcasting
E. Nonbroadcast and broadcast multi-access

A. Hierarchical OSPF networks need to be in one area
B. Multiple OSPF areas must connect to area 0
C. Single area OSPF networks must be configured in area 1
D. Areas can be assigned any number from 0 to 63535
E. Area 0 is called the backbone area
F. Each OSPF area need to be configured with a loopback interface

A. It confines network instability to a single area of network.
B. It increases the routing overhead of the network
C. It supports VLSM
D. It routes between Autonomous Systems.
E. It allows extensive control of routing updates
F. None of the above

A. 1
B. 10
C. 1562
D. 64000
E. 128000
F. None of the above

A. Distance vector protocols send the entire routing table to directly connected neighbors.
B. Distance vector protocols are responsible for sending updates to all networks listed in the routing table.
C. Link state protocols are responsible for sending the entire routing table to the whole network.
D. Link state protocols send updates regarding their own links status to all other routers on the network.
E. None of the above