Sample Questions:

Q) Which route summarization most efficiently reduces perceived network complexity that is composed of subnetworks ranging from 172.16.20.0/24 to 172.16.36.024?

A.172.16.8.021

B.172.16.8.019

C.172.16.20.020

D.172.16.0.018

E.172.16.20.019

Q) What is the recommended subnet between two sites that have a point-to-point connection to conserve IP addresses?

A .255.255.255.0

B. 255.255.252.0

C. 255.255.255.252

D. 255.255.255.240

Q) In which OSI layer does IS-IS operate?

A. Layer 1

B. Layer 2

C. Layer 3

D. Layer 4

Q) Which algorithm does IS-IS use to determine the shortest path through a network?

A. Bellman-Ford routing algorithm

B. Johnson's algorithm

C. Dijkstra's algorithm

D. Floyd-Warshall algorithm

Q) Which unique EIGRP feature allows for faster Layer 3 convergence?

A. fast EIGRP timers

B. feasible successors

C. hybrid routing protocol

D. Cisco proprietary protocol

Q) EIGRP uses which algorithm to build a routing table?

A. Dijkstra's algorithm

B. Floyd-Warshall algorithm

C. Diffusing Update Algorithm

D. Johnson's algorithm

Q) What is the maximum number of routers that each OSPF area (including the backbone) should contain?

A. 30

B. 10

C. 50

D. 100

Q) What is the maximum number of neighbors that a router should have in an OSPF area?

A. 5

B. 30

C. 60

D. 99