1. Which dynamic routing protocol was developed as an exterior gateway protocol to interconnect different Internet providers?
BGP*
EIGRP
OSPF
RIP
2. In the context of routing protocols, what is a definition for time to convergence?
the amount of time a network administrator needs to configure a routing protocol in a small- to medium-sized network
the capability to transport data, video, and voice over the same media
a measure of protocol configuration complexity
the amount of time for the routing tables to achieve a consistent state after a topology change*
3. An OSPF enabled router is processing learned routes to select best paths to reach a destination network. What is the OSPF algorithm evaluating as the metric?
The amount of packet delivery time and slowest bandwidth.
The number of hops along the routing path.
The amount of traffic and probability of failure of links.
The cumulative bandwidth that is used along the routing path.*
4. What is the difference between interior and exterior routing protocols?
Exterior routing protocols are used only by large ISPs. Interior routing protocols are used by small ISPs.
Interior routing protocols are used to route on the Internet. Exterior routing protocols are used inside organizations.
Exterior routing protocols are used to administer a single autonomous system. Interior routing protocols are used to administer several domains.
Interior routing protocols are used to communicate within a single autonomous system. Exterior routing protocols are used to communicate between multiple autonomous systems.*
5. What are two purposes of dynamic routing protocols? (Choose two.)
provide a default route to network hosts
discover remote networks*
provide network security
reduce network traffic
select best path to destination networks*
6. Which routing protocol is designed to use areas to scale large hierarchical networks?
RIP
EIGRP
OSPF*
BGP
7. Which two routing protocols are classified as distance vector routing protocols? (Choose two.)
OSPF
EIGRP*
BGP
IS-IS
RIP*
8. Refer to the exhibit.
A network administrator has configured RIPv2 in the given topology. Which path would a packet take to get from the LAN that is connected to R1 to the LAN that is connected to R7?
R1–R3–R4–R5–R6–R7
R1–R3–R2–R6–R7
R1–R3–R2–R6–R7
R1–R2–R6–R7*
9. Which routing protocol sends a routing update to neighboring routers every 30 seconds?
RIP*
EIGRP
OSPF
BGP
10. After a network topology change occurs, which distance vector routing protocol can send an update message directly to a single neighboring router without unnecessarily notifying other routers?
IS-IS
RIPv2
EIGRP*
OSPF
RIPv1
11. Which feature provides secure routing updates between RIPv2 neighbors?
unicast updates
routing protocol authentication*
keepalive messages
adjacency table
12. What is maintained within an EIGRP topology table?
all routes received from neighbors*
the hop count to all networks
the area ID of all neighbors
the state of all links on the network
13. A network administrator is researching routing protocols for implementation in a critical network infrastructure. Which protocol uses the DUAL algorithm to provide almost instantaneous convergence during a route failover?
EIGRP*
RIP
OSPF
BGP
14. Refer to the exhibit.
OSPF is used in the network. Which path will be chosen by OSPF to send data packets from Net A to Net B?
R1, R2, R5, R7
R1, R3, R5, R7*
R1, R3, R6, R7
R1, R4, R6, R7
R1, R3, R5, R6, R7
15. What are two features of the OSPF routing protocol? (Choose two.)
automatically summarizes networks at the classful boundaries
has an administrative distance of 100
calculates its metric using bandwidth*
uses Dijkstra’s algorithm to build the SPF tree*
used primarily as an EGP
16. Which two protocols are link-state routing protocols? (Choose two.)
RIP
OSPF*
EIGRP
BGP
IS-IS*
IGP
17. Which routing protocol uses link-state information to build a map of the topology for computing the best path to each destination network?
OSPF*
EIGRP
RIP
RIPng
18. Which two requirements are necessary before a router configured with a link-state routing protocol can build and send its link-state packets? (Choose two.)
The router has determined the costs associated with its active links.*
The router has built its link-state database.
The routing table has been refreshed.
The router has established its adjacencies.*
The router has constructed an SPF tree.
19. What happens when two link-state routers stop receiving hello packets from neighbors?
They continue to operate as normal and are able to exchange packets.
They consider the neighbor to be unreachable and the adjacency is broken.*
They create a default route to the adjacent router.
They will flood their database tables to each other.
20. Which two events will trigger the sending of a link-state packet by a link-state routing protocol? (Choose two.)
the router update timer expiring
a link to a neighbor router has become congested
a change in the topology*
the initial startup of the routing protocol process*
the requirement to periodically flood link-state packets to all neighbors
21. What is the first step taken by a newly configured OSPF router in the process of reaching a state of convergence?
It builds the topological database.
It floods LSP packets to neighboring routers.
It learns about directly connected links in an active state.*
It exchanges hello messages with a neighboring router.
22. Which two components of an LSP enable an OSPF router to determine if the LSP that is received contains newer information than what is in the current OSPF router link-state database? (Choose two.)
query
sequence numbers*
acknowledgements
hellos
aging information*
23. Which statement is an incorrect description of the OSPF protocol?
Multiarea OSPF helps reduce the size of the link-state database.
OSPF builds a topological map of the network.
When compared with distance vector routing protocols, OSPF utilizes less memory and less CPU processing power.*
OSPF has fast convergence.
24. What is a disadvantage of deploying OSPF in a large single area routing environment?
OSPF uses multicast updates.
OSPF uses excessive LSP flooding.*
OSPF uses a topology database of alternate routes.
OSPF uses a metric of bandwidth and delay.
