Correct answer: (A) OSPF implements Bellman-Ford algorithm to find shortest paths.; (C) OSPF is used as an inter-domain routing protocol.
Explanation
OSPF is a link-state protocol that uses Dijkstra, not Bellman-Ford. It is an intra-domain protocol (inter-domain uses BGP). It supports hierarchical routing through areas.
More Routing: Distance Vector and Link State Routing questions
GATE 2022 CS Q57– Consider a network with three routers P, Q, R connected in a line P—Q—R. All the links…
GATE 2014 CS (CS1) Q33– For link-state and distance-vector routing in a network of 500 nodes and 4000 links: S1:…
GATE 2014 CS (CS2) Q33– Which statement about interior routing protocols RIP and OSPF is TRUE?
GATE 2017 CS (CS2) Q19– For RIP and OSPF in IPv4: I: RIP uses distance-vector routing. II: RIP packets use UDP.…
GATE 2011 CS Q62– A symmetric five-node distance-vector network has links…
GATE 2011 CS Q63– A symmetric five-node distance-vector network has links…