Statement (A): Incorrect.
OSPF does not use the Bellman-Ford algorithm. Bellman-Ford is used by distance vector protocols like RIP (Routing Information Protocol). OSPF is a link-state protocol and uses Dijkstra’s algorithm. Hence, this statement is False.
Statement (B): Correct.
OSPF is based on link-state routing and indeed uses Dijkstra’s shortest path algorithm to calculate least-cost paths from source to all other nodes in the network. Hence, this statement is True.
Statement (C): Incorrect.
OSPF is an intra-domain (or interior gateway) protocol, used within an Autonomous System (AS). Inter-domain routing protocols are BGP (Border Gateway Protocol). Hence, calling OSPF inter-domain is False.
Statement (D): Correct.
OSPF allows hierarchical routing by dividing the network into multiple areas. This reduces routing overhead and improves scalability. Hence, this statement is True.
\[
\boxed{\text{Incorrect Statements: (A) and (C)}}
\]