| 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. |
| LIST I | LIST II |
|---|---|
| (A) limx→1(1 − x)1/x | (I) e |
| (B) limx→0 1/x ln(1 − x) | (II) 1 |
| (C) limx→0 (1 + x2)1/x | (III) 0 |
| (D) limx→∞ (1 + 1/x)x | (IV) 2 |
| LIST I | LIST II |
|---|---|
| (A) Floyd-Warshall algorithm for all pair shortest paths | (I) Divide and Conquer |
| (B) Prim’s algorithm | (II) Greedy Paradigm |
| (C) Hamiltonian Circuit | (III) Backtracking |
| (D) Merge Sort | (IV) Dynamic Programming paradigm |