LIST I | LIST II |
---|---|
(A) A* Algorithm | (I) Space complexity is O4, where d = depth of the deepest optimal solution. |
(B) Recursive Best First Search | (II) Incomplete even if the search space is finite. |
(C) Recursive Best First Search | (III) Optimal, if the optimal solution is reachable, otherwise returns the best reachable optimal solution. |
(D) SMA* Algorithm | (IV) Computation and space complexity is too high. |
Consider the following statements:
(A) Availability is generally conserved.
(B) Availability can neither be negative nor positive.
(C) Availability is the maximum theoretical work obtainable.
(D) Availability can be destroyed in irreversibility's.