EIGRP uses the ____________ algorithm for finding shortest path.

Related MCQs

• In Unicast Routing, Dijkstra algorithm creates a shortest path tree from a ________
• EIGRP metric is ________
• EIGRP can support ____________
• EIGRP sends a hello message after every ___________ seconds.
• Administrative distance for internal EIGRP is ______
• The EIGRP metric values include:
• Administrative distance for external EIGRP route is _______
• Open Shortest Path First (OSPF) is also called as _____________
• The computation of the shortest path in OSPF is usually done by ____________
• In TDM, the transmission rate of the multiplexed path is usually _______ the sum of the transmission rates of the signal sources.