Computer Sciences > GATE 2023 > Computer Networks

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

Which of the following statements is/are INCORRECT about the OSPF (Open Shortest Path First) routing protocol used in the Internet?

A

OSPF implements Bellman-Ford algorithm to find shortest paths.

B

OSPF uses Dijkstra's shortest path algorithm to implement least-cost path routing.

C

OSPF is used as an inter-domain routing protocol.

D

OSPF implements hierarchical routing.

Check Answer

Explanation

Correct : a,c

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?

Question #23 Medium

Which operations on a binary search tree have O(h) complexity?

Question #31 Easy

Compare search complexities of sorted array vs balanced BST.

Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science