Match List I with List II \(\begin{array}{llll} & \text{List I} & & \text{List…

PYQ UGC NET 2020

Match List I with List II

List IList II(A)Greedy Best-First Search(I)Space complexity is O(d) whered=depth of the deepest optimalsolution(B)A∗(II)Incomplete even if the search space isfinite(C)Recursive Best-First Search(III)Optimal if optimal solution isreachable; otherwise, returns the bestreachable optimal solution(D)SMA*(IV)Computation and space complexityis too high\begin{array}{llll} & \text{List I} & & \text{List II} \\ (A) & \text{Greedy Best-First Search} & (I) & \text{Space complexity is O(d) where} \\ &&& \text{d=depth of the deepest optimal} \\ &&& \text{solution} \\ (B) & A^* & (II) & \text{Incomplete even if the search space is} \\ &&& \text{finite} \\ (C) & \text{Recursive Best-First Search} & (III) & \text{Optimal if optimal solution is} \\ &&& \text{reachable; otherwise, returns the best} \\ &&& \text{reachable optimal solution} \\ (D) & \text{SMA*} & (IV) & \text{Computation and space complexity} \\ &&& \text{is too high} \end{array}

Choose the correct answer from the options given below:

  1. A.

    A-II, B-IV, C-I, D-III\text{A-II, B-IV, C-I, D-III}

  2. B.

    A-II, B-III, C-I, D-IV\text{A-II, B-III, C-I, D-IV}

  3. C.

    A-III, B-II, C-IV, D-I\text{A-III, B-II, C-IV, D-I}

  4. D.

    A-III, B-IV, C-II, D-I\text{A-III, B-IV, C-II, D-I}

Attempted by 143 students.

Sign up free to check your answer

Sign up free

Explore the full course: Nta Ugc Net Paper 2

Loading lesson…