Match List I with List II and choose the correct answer from the code given…

PYQ UGC NET 2018

Match List I with List II and choose the correct answer from the code given below.

List–I (Search technique)

List–II (Description)

(a) Greedy Best-First Search

(i) Selects a node for expansion if optimal path to that node has been found.

(b) A* Search

(ii) Avoids substantial overhead associated with keeping the sorted queue of nodes.

(c) Recursive Best-First Search

(iii) Suffers from excessive node generation.

(d) Iterative-deepening A* Search

(iv) Time complexity depends on the quality of heuristic code.

  1. A.

    (a) – (i), (b)-(ii), (c)-(iii), (d)-(iv)

  2. B.

    (a) – (iv), (b)-(i), (c)-(ii), (d)-(iii)

  3. C.

    (a) – (iv), (b)-(iii), (c)-(ii), (d)-(i)

  4. D.

    (a) – (i), (b)-(iv), (c)-(iii), (d)-(ii)

Attempted by 109 students.

Sign up free to check your answer

Sign up free

Explore the full course: Nta Ugc Net Paper 2

Loading lesson…