PreTest Day 02

Open Shortest Path First (OSPF) is also called as _____________

• Link state protocol

• Error-correction protocol

• Routing information protocol

• Border gateway protocol

The computation of the shortest path in OSPF is usually done by

• Bellman-ford algorithm

• Routing information protocol

• Dijkstra’s algorithm

• Distance vector routing

Which of the following is false with respect to the features of OSPF ?

• Support for fixed-length subnetting by including the subnet mask in the routing message

• More flexible link cost than can range from 1 to 65535

• Use of designated router

• Distribution of traffic over multiple paths that have equal cost to the destination

In OSPF, which protocol is used to discover neighbour routers automatically ?

• Link state protocol

• Error-correction protocol

• Routing information protocol

• Hello Message

Distance vector protocols use the concept of split horizon, but link-state routing protocols, such as OSPF, do not.

• True

• False

EIGRP is a routing protocol design by Cisco

• True

• False

EIGRP metric is ________

• K-values

• Bandwidth only

• Delay only

• Hop Count

EIGRP can support ____________

• VLSM/subnetting

• Auto summary

• Unequal cast load balancing

• All of the mentioned

Administrative distance for internal EIGRP is ______

• 90

• 170

• 110

• 120

EIGRP uses the ____________ algorithm for finding shortest path.

• SPF

• DUAL

• Bellman-Ford

• Djikstra